Home
last modified time | relevance | path

Searched refs:node_hash (Results 1 – 3 of 3) sorted by relevance

/third_party/glib/glib/
Dghash.c466 guint node_hash; in g_hash_table_lookup_node() local
479 node_hash = hash_table->hashes[node_index]; in g_hash_table_lookup_node()
481 while (!HASH_IS_UNUSED (node_hash)) in g_hash_table_lookup_node()
487 if (node_hash == hash_value) in g_hash_table_lookup_node()
501 else if (HASH_IS_TOMBSTONE (node_hash) && !have_tombstone) in g_hash_table_lookup_node()
510 node_hash = hash_table->hashes[node_index]; in g_hash_table_lookup_node()
761 guint node_hash = hash_table->hashes[i]; \
764 if (!HASH_IS_REAL (node_hash)) \
784 hash_val = g_hash_table_hash_to_index (hash_table, node_hash); \
796 hash_table->hashes[hash_val] = node_hash; \
[all …]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DHexagonCommonGEP.cpp491 static unsigned node_hash(GepNode *N) { in node_hash() function
503 if (node_hash(N1) != node_hash(N2)) in node_eq()
544 unsigned H = node_hash(N); in common()
/third_party/mindspore/mindspore/core/ir/
Dmanager.cc42 const std::hash<AnfNodePtr> node_hash; in operator ()() local
43 return hash_combine({node_hash(e.cnode), IntToSize(e.index), node_hash(e.input)}); in operator ()()