pike.git / src / hashtable.c

version» Context lines:

pike.git/src/hashtable.c:87:   #endif       new=(struct hash_table *)calloc(1,sizeof(struct hash_table)+    (size-1)*sizeof(struct hash_entry *));    new->mask = size - 1;    new->entries = h->entries;       for(e=0; e<=h->mask; e++)    rehash_list_backwards(new,h->htable[e]);    -  free((char *)h); +  free(h);    return new;   }      /*    * insert a newly created hash entry on it's rightful place in the    * hashtable    */   struct hash_table *hash_insert(struct hash_table *h, struct hash_entry *s)   {    struct hash_entry **base;
pike.git/src/hashtable.c:166:    struct hash_entry *i, *n;    for(e=0;e<=h->mask;e++)    {    for(i=h->htable[e];i;i=n)    {    n=i->next;    free_string(i->s);    if(free_entry)    free_entry(i);    else -  free((char *)i); +  free(i);    }    } -  free((char *)h); +  free(h);   }