rem: printf("entry %d:%ld already in the hash table!\n", dev, bnum);
add: printf("entry %d:%Ld already in the hash table!\n", dev, bnum);
context: hash_insert(hash_table *ht, int dev, fs_off_t bnum, void *data){    fs_off_t    hash;    hash_ent *he, *curr;    hash = HASH(dev, bnum) & ht->mask;    curr = ht->table[hash];    for(; curr != NULL; curr=curr->next)        if (curr->dev == dev && curr->bnum == bnum)            break;    if (curr && curr->dev == dev && curr->bnum == bnum) {        printf("entry %d:%ld already in the hash table!\n", dev, bnum);        return EEXIST;    }    he = new_hash_ent(dev, bnum, data);    if (he == NULL)        return ENOMEM;        he->next        = ht->table[hash];    ht->table[hash] = he;    ht->num_elements++;    if (ht->num_elements >= ((ht->max * 3) / 4)) {        if (grow_hash_table(ht) != 0)            return ENOMEM;    }    return 0;}