Searched refs:hash (Results 26 - 38 of 38) sorted by relevance

12

/gem5/ext/testlib/
H A Dhelper.py109 This class guarantees that hash() will be called no more than once per
110 element. This is important because the cacheresult() will hash the key
118 def __init__(self, tup, hash=hash):
120 self.hashvalue = hash(tup)
133 argument and its data type is known to cache its hash value, then that
/gem5/src/cpu/pred/
H A Dmultiperspective_perceptron.hh87 static inline unsigned int hash(unsigned int key, unsigned int i) function in class:MultiperspectivePerceptron::MPPBranchInfo
95 return hash(pc, -pcshift);
239 * Gets the hash to index the table, using the pc of the branch,
245 * @result resulting hash value that will be used to index the table
493 return hash(mpp.threadData[tid]->ghist_words, mpp.blockSize, p1,
497 static unsigned int hash(const std::vector<unsigned int> &ghist_words, function in class:MultiperspectivePerceptron::GHIST
944 return hash(mpp.threadData[tid]->recency_stack, mpp.table_sizes,
948 static unsigned int hash( function in class:MultiperspectivePerceptron::RECENCYPOS
H A Dmultiperspective_perceptron.cc277 // shift the hash from the feature to xor with the hashed PC
294 h ^= RECENCYPOS::hash(threadData[tid]->recency_stack, table_sizes,
333 // get the hash to index the table
420 // get the hash to index the table
/gem5/ext/systemc/src/sysc/utils/
H A Dsc_hash.cpp22 sc_hash.cpp -- Implementation of a chained hash table with MTF
79 reorder_flag(reorder), grow_factor(grow), bins(0), hash(hash_fn),
101 hash = h;
H A Dsc_hash.h22 sc_hash.cpp -- Implementation of a chained hash table with MTF
69 hash_fn_t hash; member in class:sc_core::sc_phash_base
73 unsigned do_hash(const void* key) const { return (*hash)(key) % num_bins; }
/gem5/src/arch/x86/
H A Dtypes.hh357 struct hash<X86ISA::ExtMachInst> { struct in namespace:std
/gem5/src/base/
H A Dcp_annotate.hh128 * Provide a hash function for the CPI Id type
132 struct hash<std::pair<std::string, uint64_t> > struct in namespace:std
138 return hash<std::string>()(x.first);
/gem5/ext/googletest/googlemock/scripts/
H A Dupload.py990 # Map of filename -> hash of base file.
1012 # We want to save the left hash, as that identifies the base file.
1027 hash = self.base_hashes[filename]
1031 if hash == "0" * 40: # All-zero hash indicates no base file.
1036 base_content, returncode = RunShellWithReturnCode(["git", "show", hash])
1038 ErrorExit("Got error status from 'git show %s'" % hash)
1324 # Send a hash of all the base file so the server can determine if a copy
/gem5/ext/googletest/googletest/scripts/
H A Dupload.py990 # Map of filename -> hash of base file.
1012 # We want to save the left hash, as that identifies the base file.
1027 hash = self.base_hashes[filename]
1031 if hash == "0" * 40: # All-zero hash indicates no base file.
1036 base_content, returncode = RunShellWithReturnCode(["git", "show", hash])
1038 ErrorExit("Got error status from 'git show %s'" % hash)
1324 # Send a hash of all the base file so the server can determine if a copy
/gem5/ext/pybind11/tests/
H A Dtest_stl.cpp49 struct hash<TplCtorClass> { size_t operator()(const TplCtorClass &) const { return 0; } }; struct in namespace:std
H A Dtest_pytypes.cpp285 m.def("hash_function", [](py::object obj) { return py::hash(obj); });
/gem5/src/arch/hsail/
H A DBrig_new.hpp1580 uint8_t hash[64]; member in struct:BrigModuleHeader
/gem5/ext/pybind11/include/pybind11/
H A Dpytypes.h441 inline ssize_t hash(handle obj) { function

Completed in 55 milliseconds

12