Ichthyostega
fef0c05b64
* using a simplified preliminary implementation of hash chaining (see #1293) * simplistic implementation of hashing for time values (half-rotation) * for now just hashing the time into the upper part of the LUID Maybe we can even live with that implementation for some time, depending on how important uniform distribution of hash values is for proper usage of the frame cache. Needless to say, various further fine points need more consideration, especially questions of portability (32bit anyone?). Moreover, since frame times are typically quantised, the search space for the hashed time values is drastically reduced; conceivably we should rather research and implement a good hash function for 128bit and then combine all information into a single hash key.... |
||
|---|---|---|
| .. | ||
| dummy-job.cpp | ||
| dummy-job.hpp | ||
| job-hash-test.cpp | ||
| scheduler-interface-test.cpp | ||