HomeSort by: relevance | last modified time | path
    Searched defs:hash_code (Results 1 - 6 of 6) sorted by relevancy

  /src/external/gpl3/binutils/dist/gprofng/src/
HashMap.h 297 int hash_code = hashCode (key); local
298 for (Hash_t *p = hashTable[hash_code]; p; p = p->next)
309 int hash_code = hashCode (key); local
310 for (Hash_t *p = hashTable[hash_code]; p; p = p->next)
322 int hash_code = hashCode (key); local
324 for (p = hashTable[hash_code]; p; p = p->next)
346 p->next = hashTable[hash_code];
347 hashTable[hash_code] = p;
356 int hash_code = hashCode (key); local
358 for (Hash_t *prev = NULL, *p = hashTable[hash_code]; p != NULL;
384 int hash_code = hashCode (key); local
    [all...]
PathTree.cc 450 unsigned int hash_code = (unsigned int) instr->id % desc_htable_size; local
453 for (p = descHT[hash_code]; p; p = p->next)
465 p->next = descHT[hash_code];
466 descHT[hash_code] = p;
490 hash_code = (unsigned int) dnode_instr->id % desc_htable_size;
491 new_p->next = descHT[hash_code];
492 descHT[hash_code] = new_p;
  /src/external/gpl3/binutils.old/dist/gprofng/src/
HashMap.h 297 int hash_code = hashCode (key); local
298 for (Hash_t *p = hashTable[hash_code]; p; p = p->next)
309 int hash_code = hashCode (key); local
310 for (Hash_t *p = hashTable[hash_code]; p; p = p->next)
322 int hash_code = hashCode (key); local
324 for (p = hashTable[hash_code]; p; p = p->next)
346 p->next = hashTable[hash_code];
347 hashTable[hash_code] = p;
356 int hash_code = hashCode (key); local
358 for (Hash_t *prev = NULL, *p = hashTable[hash_code]; p != NULL;
384 int hash_code = hashCode (key); local
    [all...]
PathTree.cc 450 unsigned int hash_code = (unsigned int) instr->id % desc_htable_size; local
453 for (p = descHT[hash_code]; p; p = p->next)
465 p->next = descHT[hash_code];
466 descHT[hash_code] = p;
490 hash_code = (unsigned int) dnode_instr->id % desc_htable_size;
491 new_p->next = descHT[hash_code];
492 descHT[hash_code] = new_p;
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
Hashing.h 16 // -- 'hash_code' class is an opaque type representing the hash code for some
20 // to assume much about the internals of a hash_code. In particular, each
22 // hash_code for a given input. Thus their values are not stable to save or
33 // a single hash_code for their object. They should only logically be used
67 /// In order to obtain the hash_code for an object 'x':
70 /// llvm::hash_code code = hash_value(x);
72 class hash_code { class in namespace:llvm
76 /// Default construct a hash_code.
78 hash_code() = default;
81 hash_code(size_t value) : value(value) { function in class:llvm::hash_code
    [all...]
  /src/sys/dev/ic/
cs89x0.c 1299 uint16_t hash_code; local
1303 hash_code = crc >> 26;
1304 return hash_code;

Completed in 33 milliseconds