Lines Matching refs:hashv
45 * o not 64 bit compliant (most users do hashv = (int) self)
449 void hashbin_insert(hashbin_t* hashbin, irda_queue_t* entry, long hashv,
464 hashv = hash( name );
465 bin = GET_HASHBIN( hashv );
475 entry->q_hash = hashv;
515 long hashv;
519 hashv = entry->q_hash;
520 bin = GET_HASHBIN( hashv );
549 * Function hashbin_remove (hashbin, hashv, name)
555 * possible to guarantee the unicity of the index (either hashv or name),
562 void* hashbin_remove( hashbin_t* hashbin, long hashv, const char* name)
577 hashv = hash( name );
578 bin = GET_HASHBIN( hashv );
594 if ( entry->q_hash == hashv ) {
650 * of either the hashv or name.
659 long hashv;
681 hashv = entry->q_hash;
682 bin = GET_HASHBIN( hashv );
712 * Function hashbin_common_find (hashbin, hashv, name)
714 * Find item with the given hashv or name
717 void* hashbin_find( hashbin_t* hashbin, long hashv, const char* name )
731 hashv = hash( name );
732 bin = GET_HASHBIN( hashv );
743 if ( entry->q_hash == hashv ) {
764 * Function hashbin_lock_find (hashbin, hashv, name)
766 * Find item with the given hashv or name
772 void* hashbin_lock_find( hashbin_t* hashbin, long hashv, const char* name )
783 entry = (irda_queue_t* ) hashbin_find( hashbin, hashv, name );
793 * Function hashbin_find (hashbin, hashv, name, pnext)
795 * Find an item with the given hashv or name, and its successor
802 void* hashbin_find_next( hashbin_t* hashbin, long hashv, const char* name,
816 entry = (irda_queue_t* ) hashbin_find( hashbin, hashv, name );