| tag | line | file | source code |
| hash | 285 | fs/buffer.c | if (hash(bh->b_dev,bh->b_blocknr) == bh) |
| hash | 286 | fs/buffer.c | hash(bh->b_dev,bh->b_blocknr) = bh->b_next; |
| hash | 407 | fs/buffer.c | bh->b_next = hash(bh->b_dev,bh->b_blocknr); |
| hash | 408 | fs/buffer.c | hash(bh->b_dev,bh->b_blocknr) = bh; |
| hash | 417 | fs/buffer.c | for (tmp = hash(dev,block) ; tmp != NULL ; tmp = tmp->b_next) |
| hash | 122 | fs/dcache.c | static inline void add_hash(struct dir_cache_entry * de, struct hash_list * hash) |
| hash | 124 | fs/dcache.c | de->h.next = hash->next; |
| hash | 125 | fs/dcache.c | de->h.prev = (struct dir_cache_entry *) hash; |
| hash | 126 | fs/dcache.c | hash->next->h.prev = de; |
| hash | 127 | fs/dcache.c | hash->next = de; |
| hash | 133 | fs/dcache.c | static struct dir_cache_entry * find_entry(struct inode * dir, const char * name, int len, struct hash_list * hash) |
| hash | 135 | fs/dcache.c | struct dir_cache_entry * de = hash->next; |
| hash | 137 | fs/dcache.c | for (de = hash->next ; de != (struct dir_cache_entry *) hash ; de = de->h.next) { |
| hash | 157 | fs/dcache.c | static inline void move_to_level2(struct dir_cache_entry * old_de, struct hash_list * hash) |
| hash | 169 | fs/dcache.c | add_hash(de, hash); |
| hash | 174 | fs/dcache.c | struct hash_list * hash; |
| hash | 179 | fs/dcache.c | hash = hash_table + hash_fn(dir->i_dev, dir->i_ino, namehash(name,len)); |
| hash | 180 | fs/dcache.c | de = find_entry(dir, name, len, hash); |
| hash | 184 | fs/dcache.c | move_to_level2(de, hash); |
| hash | 190 | fs/dcache.c | struct hash_list * hash; |
| hash | 195 | fs/dcache.c | hash = hash_table + hash_fn(dir->i_dev, dir->i_ino, namehash(name,len)); |
| hash | 196 | fs/dcache.c | if ((de = find_entry(dir, name, len, hash)) != NULL) { |
| hash | 210 | fs/dcache.c | add_hash(de, hash); |
| hash | 57 | fs/inode.c | h = hash(inode->i_dev, inode->i_ino); |
| hash | 69 | fs/inode.c | h = hash(inode->i_dev, inode->i_ino); |
| hash | 511 | fs/inode.c | h = hash(sb->s_dev, nr); |
| hash | 120 | net/802/tr.c | unsigned int hash; |
| hash | 130 | net/802/tr.c | for(i=0,hash=0;i<TR_ALEN;hash+=trh->daddr[i++]); |
| hash | 131 | net/802/tr.c | hash&=RIF_TABLE_SIZE-1; |
| hash | 132 | net/802/tr.c | for(entry=rif_table[hash];entry && memcmp(&(entry->addr[0]),&(trh->daddr[0]),TR_ALEN);entry=entry->next); |
| hash | 161 | net/802/tr.c | unsigned int hash; |
| hash | 166 | net/802/tr.c | for(i=0,hash=0;i<TR_ALEN;hash+=trh->saddr[i++]); |
| hash | 167 | net/802/tr.c | hash&=RIF_TABLE_SIZE-1; |
| hash | 169 | net/802/tr.c | printk("hash: %d\n",hash); |
| hash | 171 | net/802/tr.c | for(entry=rif_table[hash];entry && memcmp(&(entry->addr[0]),&(trh->saddr[0]),TR_ALEN);entry=entry->next); |
| hash | 188 | net/802/tr.c | entry->next=rif_table[hash]; |
| hash | 190 | net/802/tr.c | rif_table[hash]=entry; |
| hash | 426 | net/appletalk/aarp.c | int hash; |
| hash | 440 | net/appletalk/aarp.c | hash=sa->s_node%(AARP_HASH_SIZE-1); |
| hash | 458 | net/appletalk/aarp.c | a=aarp_find_entry(resolved[hash],dev,sa); |
| hash | 476 | net/appletalk/aarp.c | a=aarp_find_entry(unresolved[hash],dev,sa); |
| hash | 505 | net/appletalk/aarp.c | a->next=unresolved[hash]; |
| hash | 508 | net/appletalk/aarp.c | unresolved[hash]=a; |
| hash | 531 | net/appletalk/aarp.c | static void aarp_resolved(struct aarp_entry **list, struct aarp_entry *a, int hash) |
| hash | 541 | net/appletalk/aarp.c | a->next=resolved[hash]; |
| hash | 542 | net/appletalk/aarp.c | resolved[hash]=a; |
| hash | 565 | net/appletalk/aarp.c | int hash; |
| hash | 606 | net/appletalk/aarp.c | hash=ea->pa_src_node%(AARP_HASH_SIZE-1); |
| hash | 656 | net/appletalk/aarp.c | if((a=aarp_find_entry(unresolved[hash],dev,&sa))==NULL || dev != a->dev) |
| hash | 662 | net/appletalk/aarp.c | aarp_resolved(&unresolved[hash],a,hash); |
| hash | 137 | net/core/dev.c | int hash; |
| hash | 146 | net/core/dev.c | hash=ntohs(pt->type)&15; |
| hash | 147 | net/core/dev.c | pt->next = ptype_base[hash]; |
| hash | 148 | net/core/dev.c | ptype_base[hash] = pt; |
| hash | 389 | net/ipv4/arp.c | unsigned long hash; |
| hash | 429 | net/ipv4/arp.c | hash = HASH(entry->ip); |
| hash | 437 | net/ipv4/arp.c | pentry = &arp_tables[hash]; |
| hash | 518 | net/ipv4/arp.c | unsigned long hash = HASH(ip_addr); |
| hash | 522 | net/ipv4/arp.c | pentry = &arp_tables[hash]; |
| hash | 572 | net/ipv4/arp.c | unsigned long hash; |
| hash | 763 | net/ipv4/arp.c | hash = HASH(sip); |
| hash | 765 | net/ipv4/arp.c | for(entry=arp_tables[hash];entry;entry=entry->next) |
| hash | 823 | net/ipv4/arp.c | entry->next = arp_tables[hash]; |
| hash | 824 | net/ipv4/arp.c | arp_tables[hash] = entry; |
| hash | 844 | net/ipv4/arp.c | unsigned long hash; |
| hash | 882 | net/ipv4/arp.c | hash = HASH(paddr); |
| hash | 928 | net/ipv4/arp.c | entry->next = arp_tables[hash]; |
| hash | 941 | net/ipv4/arp.c | arp_tables[hash] = entry; |
| hash | 1064 | net/ipv4/arp.c | unsigned long hash = HASH(paddr); |
| hash | 1066 | net/ipv4/arp.c | for (entry = arp_tables[hash]; entry != NULL; entry = entry->next) |
| hash | 1227 | net/ipv4/arp.c | unsigned long hash = HASH(ip); |
| hash | 1229 | net/ipv4/arp.c | hash = PROXY_HASH; |
| hash | 1242 | net/ipv4/arp.c | entry->next = arp_tables[hash]; |
| hash | 1243 | net/ipv4/arp.c | arp_tables[hash] = entry; |
| hash | 279 | net/ipv4/icmp.c | unsigned char hash; |
| hash | 318 | net/ipv4/icmp.c | hash = iph->protocol & (MAX_INET_PROTOS -1); |
| hash | 324 | net/ipv4/icmp.c | ipprot = (struct inet_protocol *) inet_protos[hash]; |
| hash | 1267 | net/ipv4/ip.c | unsigned char hash; |
| hash | 1536 | net/ipv4/ip.c | hash = iph->protocol & (SOCK_ARRAY_SIZE-1); |
| hash | 1542 | net/ipv4/ip.c | if((raw_sk=raw_prot.sock_array[hash])!=NULL) |
| hash | 1546 | net/ipv4/ip.c | raw_sk=get_sock_raw(raw_sk, hash, iph->saddr, iph->daddr); |
| hash | 1552 | net/ipv4/ip.c | sknext=get_sock_raw(raw_sk->next, hash, iph->saddr, iph->daddr); |
| hash | 1577 | net/ipv4/ip.c | hash = iph->protocol & (MAX_INET_PROTOS -1); |
| hash | 1578 | net/ipv4/ip.c | for (ipprot = (struct inet_protocol *)inet_protos[hash];ipprot != NULL;ipprot=(struct inet_protocol *)ipprot->next) |
| hash | 129 | net/ipv4/protocol.c | unsigned char hash; |
| hash | 132 | net/ipv4/protocol.c | hash = prot & (MAX_INET_PROTOS - 1); |
| hash | 133 | net/ipv4/protocol.c | for (p = inet_protos[hash] ; p != NULL; p=p->next) { |
| hash | 143 | net/ipv4/protocol.c | unsigned char hash; |
| hash | 146 | net/ipv4/protocol.c | hash = prot->protocol & (MAX_INET_PROTOS - 1); |
| hash | 147 | net/ipv4/protocol.c | prot ->next = inet_protos[hash]; |
| hash | 148 | net/ipv4/protocol.c | inet_protos[hash] = prot; |
| hash | 168 | net/ipv4/protocol.c | unsigned char hash; |
| hash | 170 | net/ipv4/protocol.c | hash = prot->protocol & (MAX_INET_PROTOS - 1); |
| hash | 171 | net/ipv4/protocol.c | if (prot == inet_protos[hash]) { |
| hash | 172 | net/ipv4/protocol.c | inet_protos[hash] = (struct inet_protocol *) inet_protos[hash]->next; |
| hash | 176 | net/ipv4/protocol.c | p = (struct inet_protocol *) inet_protos[hash]; |