h                1153 mod_freetdm/mod_freetdm.c 	switch_event_header_t *h;
h                1387 mod_freetdm/mod_freetdm.c 	for (h = var_event->headers; h; h = h->next) {
h                1388 mod_freetdm/mod_freetdm.c 		if (!strncasecmp(h->name, FREETDM_VAR_PREFIX, FREETDM_VAR_PREFIX_LEN)) {
h                1389 mod_freetdm/mod_freetdm.c 			char *v = h->name + FREETDM_VAR_PREFIX_LEN;
h                1391 mod_freetdm/mod_freetdm.c 				switch_log_printf(SWITCH_CHANNEL_LOG, SWITCH_LOG_DEBUG, "Adding outbound freetdm variable %s=%s to channel %d:%d\n", v, h->value, span_id, chan_id);
h                1392 mod_freetdm/mod_freetdm.c 				ftdm_call_add_var(&caller_data, v, h->value);
h                  65 src/hashtable.c     struct hashtable *h;
h                  73 src/hashtable.c     h = (struct hashtable *)ftdm_malloc(sizeof(struct hashtable));
h                  74 src/hashtable.c     if (NULL == h) return NULL; /*oom*/
h                  75 src/hashtable.c     h->table = (struct entry **)ftdm_malloc(sizeof(struct entry*) * size);
h                  76 src/hashtable.c     if (NULL == h->table) { ftdm_safe_free(h); return NULL; } /*oom*/
h                  77 src/hashtable.c     memset(h->table, 0, size * sizeof(struct entry *));
h                  78 src/hashtable.c     h->tablelength  = size;
h                  79 src/hashtable.c     h->primeindex   = pindex;
h                  80 src/hashtable.c     h->entrycount   = 0;
h                  81 src/hashtable.c     h->hashfn       = hashf;
h                  82 src/hashtable.c     h->eqfn         = eqf;
h                  83 src/hashtable.c     h->loadlimit    = (unsigned int) ceil(size * max_load_factor);
h                  84 src/hashtable.c     return h;
h                  89 src/hashtable.c hash(struct hashtable *h, void *k)
h                  93 src/hashtable.c     unsigned int i = h->hashfn(k);
h                 103 src/hashtable.c hashtable_expand(struct hashtable *h)
h                 111 src/hashtable.c     if (h->primeindex == (prime_table_length - 1)) return 0;
h                 112 src/hashtable.c     newsize = primes[++(h->primeindex)];
h                 120 src/hashtable.c 			for (i = 0; i < h->tablelength; i++) {
h                 121 src/hashtable.c 				while (NULL != (e = h->table[i])) {
h                 122 src/hashtable.c 					h->table[i] = e->next;
h                 123 src/hashtable.c 					index = indexFor(newsize,e->h);
h                 128 src/hashtable.c 			ftdm_safe_free(h->table);
h                 129 src/hashtable.c 			h->table = newtable;
h                 135 src/hashtable.c 				realloc(h->table, newsize * sizeof(struct entry *));
h                 136 src/hashtable.c 			if (NULL == newtable) { (h->primeindex)--; return 0; }
h                 137 src/hashtable.c 			h->table = newtable;
h                 138 src/hashtable.c 			memset(newtable[h->tablelength], 0, newsize - h->tablelength);
h                 139 src/hashtable.c 			for (i = 0; i < h->tablelength; i++) {
h                 141 src/hashtable.c 					index = indexFor(newsize,e->h);
h                 155 src/hashtable.c     h->tablelength = newsize;
h                 156 src/hashtable.c     h->loadlimit   = (unsigned int) ceil(newsize * max_load_factor);
h                 162 src/hashtable.c hashtable_count(struct hashtable *h)
h                 164 src/hashtable.c     return h->entrycount;
h                 169 src/hashtable.c hashtable_insert(struct hashtable *h, void *k, void *v, hashtable_flag_t flags)
h                 174 src/hashtable.c     if (++(h->entrycount) > h->loadlimit)
h                 180 src/hashtable.c 			hashtable_expand(h);
h                 183 src/hashtable.c     if (NULL == e) { --(h->entrycount); return 0; } /*oom*/
h                 184 src/hashtable.c     e->h = hash(h,k);
h                 185 src/hashtable.c     index = indexFor(h->tablelength,e->h);
h                 189 src/hashtable.c     e->next = h->table[index];
h                 190 src/hashtable.c     h->table[index] = e;
h                 196 src/hashtable.c hashtable_search(struct hashtable *h, void *k)
h                 200 src/hashtable.c     hashvalue = hash(h,k);
h                 201 src/hashtable.c     index = indexFor(h->tablelength,hashvalue);
h                 202 src/hashtable.c     e = h->table[index];
h                 206 src/hashtable.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v;
h                 214 src/hashtable.c hashtable_remove(struct hashtable *h, void *k)
h                 224 src/hashtable.c     hashvalue = hash(h,k);
h                 225 src/hashtable.c     index = indexFor(h->tablelength,hash(h,k));
h                 226 src/hashtable.c     pE = &(h->table[index]);
h                 231 src/hashtable.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
h                 234 src/hashtable.c 					h->entrycount--;
h                 251 src/hashtable.c hashtable_destroy(struct hashtable *h)
h                 255 src/hashtable.c     struct entry **table = h->table;
h                 257 src/hashtable.c 	for (i = 0; i < h->tablelength; i++)
h                 264 src/hashtable.c     ftdm_safe_free(h->table);
h                 265 src/hashtable.c     ftdm_safe_free(h);
h                 279 src/hashtable.c 	while(i->pos < i->h->tablelength && !i->h->table[i->pos]) {
h                 283 src/hashtable.c 	if (i->pos >= i->h->tablelength) {
h                 287 src/hashtable.c 	if ((i->e = i->h->table[i->pos]) != 0) { 
h                 294 src/hashtable.c FT_DECLARE(struct hashtable_iterator *) hashtable_first(struct hashtable *h)
h                 296 src/hashtable.c 	h->iterator.pos = 0;
h                 297 src/hashtable.c 	h->iterator.e = NULL;
h                 298 src/hashtable.c 	h->iterator.h = h;
h                 299 src/hashtable.c 	return hashtable_next(&h->iterator);
h                  44 src/hashtable_itr.c hashtable_iterator(struct hashtable *h)
h                  49 src/hashtable_itr.c     itr->h = h;
h                  52 src/hashtable_itr.c     tablelength = h->tablelength;
h                  54 src/hashtable_itr.c     if (0 == h->entrycount) return itr;
h                  58 src/hashtable_itr.c 			if (NULL != h->table[i])
h                  60 src/hashtable_itr.c 					itr->e = h->table[i];
h                  87 src/hashtable_itr.c     tablelength = itr->h->tablelength;
h                  94 src/hashtable_itr.c     table = itr->h->table;
h                 127 src/hashtable_itr.c 			itr->h->table[itr->index] = itr->e->next;
h                 134 src/hashtable_itr.c     itr->h->entrycount--;
h                 148 src/hashtable_itr.c                           struct hashtable *h, void *k)
h                 153 src/hashtable_itr.c     hashvalue = hash(h,k);
h                 154 src/hashtable_itr.c     index = indexFor(h->tablelength,hashvalue);
h                 156 src/hashtable_itr.c     e = h->table[index];
h                 161 src/hashtable_itr.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
h                 166 src/hashtable_itr.c 					itr->h = h;
h                 116 src/include/private/hashtable.h hashtable_insert(struct hashtable *h, void *k, void *v, hashtable_flag_t flags);
h                 119 src/include/private/hashtable.h 	int fnname (struct hashtable *h, keytype *k, valuetype *v)	\
h                 121 src/include/private/hashtable.h 		return hashtable_insert(h,k,v);							\
h                 134 src/include/private/hashtable.h hashtable_search(struct hashtable *h, void *k);
h                 137 src/include/private/hashtable.h 	valuetype * fnname (struct hashtable *h, keytype *k)	\
h                 139 src/include/private/hashtable.h 		return (valuetype *) (hashtable_search(h,k));		\
h                 152 src/include/private/hashtable.h hashtable_remove(struct hashtable *h, void *k);
h                 155 src/include/private/hashtable.h 	valuetype * fnname (struct hashtable *h, keytype *k)	\
h                 157 src/include/private/hashtable.h 		return (valuetype *) (hashtable_remove(h,k));		\
h                 169 src/include/private/hashtable.h hashtable_count(struct hashtable *h);
h                 181 src/include/private/hashtable.h hashtable_destroy(struct hashtable *h);
h                 183 src/include/private/hashtable.h FT_DECLARE(struct hashtable_iterator*) hashtable_first(struct hashtable *h);
h                  16 src/include/private/hashtable_itr.h     struct hashtable *h;
h                  28 src/include/private/hashtable_itr.h hashtable_iterator(struct hashtable *h);
h                  77 src/include/private/hashtable_itr.h                           struct hashtable *h, void *k);
h                  80 src/include/private/hashtable_itr.h 	int fnname (struct hashtable_itr *i, struct hashtable *h, keytype *k) \
h                  82 src/include/private/hashtable_itr.h 		return (hashtable_iterator_search(i,h,k));						\
h                  16 src/include/private/hashtable_private.h     unsigned int h;
h                  24 src/include/private/hashtable_private.h 	struct hashtable *h;
h                  40 src/include/private/hashtable_private.h hash(struct hashtable *h, void *k);