Lines Matching refs:hash
62 FT_PtrDist hash; /* used for hashing too */
76 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
78 ( ( ( ( hash ) & ( cache )->mask ) < ( cache )->p ) \
79 ? ( ( hash ) & ( ( cache )->mask * 2 + 1 ) ) \
80 : ( ( hash ) & ( cache )->mask ) ) )
84 FT_PtrDist hash );
85 #define FTC_NODE__TOP_FOR_HASH( cache, hash ) \
86 ftc_get_top_node_for_hash( ( cache ), ( hash ) )
142 /* each cache really implements a dynamic hash table to manage its nodes */
182 FT_PtrDist hash,
189 FT_PtrDist hash,
210 #define FTC_CACHE_LOOKUP_CMP( cache, nodecmp, hash, query, node, error ) \
214 FT_PtrDist _hash = (FT_PtrDist)(hash); \
222 /* Go to the `top' node of the list sharing same masked hash */ \
225 /* Look up a node with identical hash and queried properties. */ \
233 if ( _node->hash == _hash && \
287 #define FTC_CACHE_LOOKUP_CMP( cache, nodecmp, hash, query, node, error ) \
289 error = FTC_Cache_Lookup( FTC_CACHE( cache ), hash, query, \