table 75 src/hashtable.c h->table = (struct entry **)ftdm_malloc(sizeof(struct entry*) * size); table 76 src/hashtable.c if (NULL == h->table) { ftdm_safe_free(h); return NULL; } /*oom*/ table 77 src/hashtable.c memset(h->table, 0, size * sizeof(struct entry *)); table 121 src/hashtable.c while (NULL != (e = h->table[i])) { table 122 src/hashtable.c h->table[i] = e->next; table 128 src/hashtable.c ftdm_safe_free(h->table); table 129 src/hashtable.c h->table = newtable; table 135 src/hashtable.c realloc(h->table, newsize * sizeof(struct entry *)); table 137 src/hashtable.c h->table = newtable; table 189 src/hashtable.c e->next = h->table[index]; table 190 src/hashtable.c h->table[index] = e; table 202 src/hashtable.c e = h->table[index]; table 226 src/hashtable.c pE = &(h->table[index]); table 255 src/hashtable.c struct entry **table = h->table; table 259 src/hashtable.c e = table[i]; table 264 src/hashtable.c ftdm_safe_free(h->table); table 279 src/hashtable.c while(i->pos < i->h->tablelength && !i->h->table[i->pos]) { table 287 src/hashtable.c if ((i->e = i->h->table[i->pos]) != 0) { table 58 src/hashtable_itr.c if (NULL != h->table[i]) table 60 src/hashtable_itr.c itr->e = h->table[i]; table 76 src/hashtable_itr.c struct entry **table; table 94 src/hashtable_itr.c table = itr->h->table; table 95 src/hashtable_itr.c while (NULL == (next = table[j])) table 127 src/hashtable_itr.c itr->h->table[itr->index] = itr->e->next; table 156 src/hashtable_itr.c e = h->table[index]; table 29 src/include/private/hashtable_private.h struct entry **table;