/drivers/gpu/drm/ttm/ |
H A D | ttm_object.c | 43 * ref_hash hash tables. 73 * @object_lock: lock that protects the object_hash hash table. 75 * @object_hash: hash table for fast lookup of object global names. 92 * @hash: Hash entry for the per-file object reference hash. 102 * This is similar to an idr object, but it also has a hash table entry 111 struct drm_hash_item hash; member in struct:ttm_ref_object 163 &base->hash, 177 (void)drm_ht_remove_item(&tdev->object_hash, &base->hash); 189 (void)drm_ht_remove_item(&tdev->object_hash, &base->hash); 221 struct drm_hash_item *hash; local 252 struct drm_hash_item *hash; local 338 struct drm_hash_item *hash; local [all...] |
/drivers/gpu/drm/ |
H A D | drm_auth.c | 44 * Searches in drm_device::magiclist within all files with the same hash key 52 struct drm_hash_item *hash; local 56 if (!drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) { 57 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item); 72 * associated the magic number hash key in drm_device::magiclist, while holding 102 * number hash key, while holding the drm_device::struct_mutex lock. 107 struct drm_hash_item *hash; local 113 if (drm_ht_find_item(&master->magiclist, (unsigned long)magic, &hash)) { 117 pt = drm_hash_entry(hash, struct drm_magic_entry, hash_item); 118 drm_ht_remove_item(&master->magiclist, hash); [all...] |
H A D | drm_gem.c | 219 * we may want to use ida for number allocation and a hash table 307 drm_ht_remove_item(&mm->offset_hash, &list->hash); 362 list->hash.key = list->file_offset_node->start; 363 ret = drm_ht_insert_item(&mm->offset_hash, &list->hash); 365 DRM_ERROR("failed to add to map hash\n"); 670 struct drm_hash_item *hash; local 678 if (drm_ht_find_item(&mm->offset_hash, vma->vm_pgoff, &hash)) { 683 map = drm_hash_entry(hash, struct drm_map_list, hash)->map;
|
H A D | drm_vm.c | 98 struct drm_hash_item *hash; local 109 if (drm_ht_find_item(&dev->map_hash, vma->vm_pgoff, &hash)) 112 r_list = drm_hash_entry(hash, struct drm_map_list, hash); 554 struct drm_hash_item *hash; local 574 if (drm_ht_find_item(&dev->map_hash, vma->vm_pgoff, &hash)) { 579 map = drm_hash_entry(hash, struct drm_map_list, hash)->map;
|
/drivers/staging/tidspbridge/include/dspbridge/ |
H A D | gh.h | 22 u16(*hash) (void *, u16),
|
/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/staging/tidspbridge/gen/ |
H A D | gh.c | 31 u16(*hash) (void *, u16); member in struct:gh_t_hash_tab 43 u16(*hash) (void *, u16), bool(*match) (void *, 54 hash_tab->hash = hash; 105 elem = hash_tab->buckets[(*hash_tab->hash) (key, hash_tab->max_bucket)]; 134 i = (*hash_tab->hash) (key, hash_tab->max_bucket); 155 * gh_iterate() - This function goes through all the elements in the hash table
|
/drivers/gpu/drm/gma500/ |
H A D | gem_glue.c | 30 drm_ht_remove_item(&mm->offset_hash, &list->hash); 76 list->hash.key = list->file_offset_node->start; 77 ret = drm_ht_insert_item(&mm->offset_hash, &list->hash); 79 dev_err(dev->dev, "failed to add to map hash\n");
|
/drivers/target/tcm_fc/ |
H A D | tfc_sess.c | 31 #include <linux/hash.h> 83 INIT_HLIST_HEAD(&tport->hash[i]); 166 * Sessions and hash lists are RCU-protected. 181 head = &tport->hash[ft_sess_hash(port_id)]; 182 hlist_for_each_entry_rcu(sess, pos, head, hash) { 197 * Allocate session and enter it in the hash for the local port. 207 head = &tport->hash[ft_sess_hash(port_id)]; 208 hlist_for_each_entry_rcu(sess, pos, head, hash) 225 hlist_add_head_rcu(&sess->hash, head); 243 hlist_del_rcu(&sess->hash); [all...] |
H A D | tcm_fc.h | 37 u32 port_id; /* for hash lookup use only */ 43 struct hlist_node hash; /* linkage in ft_sess_hash table */ member in struct:ft_sess 45 struct kref kref; /* ref for hash and outstanding I/Os */ 65 u32 sess_count; /* number of sessions in hash */ 67 struct hlist_head hash[FT_SESS_HASH_SIZE]; /* list of sessions */ member in struct:ft_tport
|
/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/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; 403 int hash local [all...] |
/drivers/char/ |
H A D | random.c | 79 * hash of the contents of the "entropy pool". The SHA hash avoids 355 * The input hash is much less sensitive than the output hash. All 356 * that we want of it is that it be a good non-cryptographic hash; 373 * this is a universal class of hash functions, meaning that the chance 379 * hash; hash collisions will occur no more often than chance. 823 __u32 hash[5], workspace[SHA_WORKSPACE_WORDS]; local 826 /* Generate a hash acros 1350 __u32 *hash; local [all...] |
/drivers/crypto/amcc/ |
H A D | crypto4xx_core.h | 25 #include <crypto/internal/hash.h> 147 struct ahash_alg hash; member in union:crypto4xx_alg_common::__anon423 163 struct crypto4xx_alg, alg.u.hash);
|
/drivers/gpu/drm/nouveau/ |
H A D | nouveau_ramht.c | 36 u32 hash = 0; local 42 hash ^= (handle & ((1 << ramht->bits) - 1)); 47 hash ^= chan->id << (ramht->bits - 4); 48 hash <<= 3; 50 NV_DEBUG(dev, "hash=0x%08x\n", hash); 51 return hash;
|
/drivers/net/ethernet/ti/ |
H A D | tlan.h | 519 * hash = XOR8(DA(a,0), DA(a, 6), DA(a,12), DA(a,18), DA(a,24), 521 * hash |= XOR8(DA(a,1), DA(a, 7), DA(a,13), DA(a,19), DA(a,25), 523 * hash |= XOR8(DA(a,2), DA(a, 8), DA(a,14), DA(a,20), DA(a,26), 525 * hash |= XOR8(DA(a,3), DA(a, 9), DA(a,15), DA(a,21), DA(a,27), 527 * hash |= XOR8(DA(a,4), DA(a,10), DA(a,16), DA(a,22), DA(a,28), 529 * hash |= XOR8(DA(a,5), DA(a,11), DA(a,17), DA(a,23), DA(a,29), 535 u8 hash; local 537 hash = (a[0]^a[3]); /* & 077 */ 538 hash ^= ((a[0]^a[3])>>6); /* & 003 */ 539 hash [all...] |
/drivers/net/ppp/ |
H A D | pppoe.c | 101 * 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 1064 int hash = hash_item(po->pppoe_pa.sid, po->pppoe_pa.remote); local [all...] |
/drivers/staging/omapdrm/ |
H A D | omap_gem_helpers.c | 153 list->hash.key = list->file_offset_node->start; 154 ret = drm_ht_insert_item(&mm->offset_hash, &list->hash); 156 DRM_ERROR("failed to add to map hash\n");
|
/drivers/net/ethernet/chelsio/cxgb4/ |
H A D | l2t.h | 52 * 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
|
H A D | l2t.c | 85 * neighbors to be on the same hash chain. We keep v4 entries in the first 86 * half of available hash buckets and v6 in the second. 115 * family, something made trivial by the separation of IP and IPv6 hash chains 289 * presently in the hash table. We need to remove it. 292 for (p = &d->l2tab[e->hash].first; *p; p = &(*p)->next) 369 int hash = addr_hash(addr, addr_len, ifidx); local 382 for (e = d->l2tab[hash].first; e; e = e->next) 398 e->hash = hash; 404 e->next = d->l2tab[hash] 446 int hash = addr_hash(addr, addr_len, ifidx); local [all...] |
/drivers/net/ethernet/sun/ |
H A D | sunvnet.h | 31 struct hlist_node hash; member in struct:vnet_port
|
/drivers/scsi/ |
H A D | libiscsi_tcp.c | 173 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/net/ethernet/amd/ |
H A D | am79c961a.c | 199 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/media/video/em28xx/ |
H A D | em28xx-i2c.c | 303 /* based on linux/sunrpc/svcauth.h and linux/hash.h 304 * The original hash function returns a different value, if arch is x86_64 309 unsigned long hash = 0; local 322 hash = ((hash^l) * 0x9e370001UL); 325 return (hash >> (32 - bits)) & 0xffffffffUL; 390 dev->hash = em28xx_hash_mem(eedata, len, 32); 392 printk(KERN_INFO "%s: EEPROM ID= 0x%08x, EEPROM hash = 0x%08lx\n", 393 dev->name, em_eeprom->id, dev->hash);
|
/drivers/pcmcia/ |
H A D | ds.c | 50 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); 929 u32 hash[4] = { 0, 0, 0, 0}; local 940 hash[i] = crc32(0, p_dev->prod_id[i], strlen(p_dev->prod_id[i])); 956 hash[0], 957 hash[1], 958 hash[ 1069 u32 hash[4] = { 0, 0, 0, 0}; local [all...] |