Lines Matching defs:hash
2820 // Compute a hash of the given graph, in a way that should provide the same
2821 // result in multiple runs of mksnapshot, meaning the hash cannot depend on any
2822 // external pointer values or uncompressed heap constants. This hash can be used
2837 // Do a depth-first post-order traversal of the graph. For every node, hash:
2853 size_t hash = 0;
2873 hash = base::hash_combine(hash, traversal_numbers[n->id()], n->opcode(),
2877 hash = base::hash_combine(hash, traversal_numbers[i->id()]);
2881 return Smi(IntToSmi(static_cast<int>(hash))).value();
2960 profile_data->hash() != graph_hash_before_scheduling) {
3513 // Verify the instruction sequence has the same hash in two stages.