e                5195 src/ftdm_io.c  FT_DECLARE(void) print_bits(uint8_t *b, int bl, char *buf, int blen, ftdm_endian_t e, uint8_t ss)
e                5206 src/ftdm_io.c  	ftdm_bitstream_init(&bs, b, bl, e, ss);
e                 251 src/ftmod/ftmod_libpri/lpwrap_pri.c 		if ((handler = spri->eventmap[event->e] ? spri->eventmap[event->e] : spri->eventmap[0] ? spri->eventmap[0] : NULL)) {
e                 252 src/ftmod/ftmod_libpri/lpwrap_pri.c 			handler(spri, event->e, event);
e                 254 src/ftmod/ftmod_libpri/lpwrap_pri.c 			ftdm_log(FTDM_LOG_CRIT, "No event handler found for event %d.\n", event->e);
e                 515 src/ftmod/ftmod_pritap/ftmod_pritap.c static void handle_pri_passive_event(pritap_t *pritap, pri_event *e)
e                 525 src/ftmod/ftmod_pritap/ftmod_pritap.c 	switch (e->e) {
e                 530 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->ring.call);
e                 532 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->ring.channel), PRI_CHANNEL(e->ring.channel), crv);
e                 543 src/ftmod/ftmod_pritap/ftmod_pritap.c 		pcall->callref = e->ring.call;
e                 544 src/ftmod/ftmod_pritap/ftmod_pritap.c 		ftdm_set_string(pcall->callingnum.digits, e->ring.callingnum);
e                 545 src/ftmod/ftmod_pritap/ftmod_pritap.c 		ftdm_set_string(pcall->callingani.digits, e->ring.callingani);
e                 546 src/ftmod/ftmod_pritap/ftmod_pritap.c 		ftdm_set_string(pcall->callednum.digits, e->ring.callednum);
e                 547 src/ftmod/ftmod_pritap/ftmod_pritap.c 		ftdm_set_string(pcall->callingname, e->ring.callingname);
e                 551 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->ring.call);
e                 553 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 557 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->proceeding.call);
e                 561 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 567 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 580 src/ftmod/ftmod_pritap/ftmod_pritap.c 		peerpcall->callref = e->proceeding.call;
e                 596 src/ftmod/ftmod_pritap/ftmod_pritap.c 		fchan = tap_pri_get_fchan(pritap, pcall, e->proceeding.channel);
e                 599 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 604 src/ftmod/ftmod_pritap/ftmod_pritap.c 		peerfchan = tap_pri_get_fchan(peertap, pcall, e->proceeding.channel);
e                 607 src/ftmod/ftmod_pritap/ftmod_pritap.c 				peertap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 619 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->answer.call);
e                 621 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->answer.channel), PRI_CHANNEL(e->answer.channel), crv);
e                 625 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 632 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->hangup.call);
e                 634 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->answer.channel), PRI_CHANNEL(e->answer.channel), crv);
e                 639 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->proceeding.channel), PRI_CHANNEL(e->proceeding.channel), crv);
e                 648 src/ftmod/ftmod_pritap/ftmod_pritap.c 		crv = tap_pri_get_crv(pritap->pri, e->hangup.call);
e                 650 src/ftmod/ftmod_pritap/ftmod_pritap.c 				pritap->span->name, PRI_SPAN(e->answer.channel), PRI_CHANNEL(e->answer.channel), crv);
e                 651 src/ftmod/ftmod_pritap/ftmod_pritap.c 		tap_pri_put_pcall(pritap, e->hangup.call);
e                 652 src/ftmod/ftmod_pritap/ftmod_pritap.c 		tap_pri_put_pcall(peertap, e->hangup.call);
e                 656 src/ftmod/ftmod_pritap/ftmod_pritap.c 		ftdm_log(FTDM_LOG_DEBUG, "Ignoring passive event %s on span %s\n", pri_event2str(e->gen.e), pritap->span->name);
e                 298 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 	sangomabc_queue_element_t *e = NULL;
e                 301 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 		e = ftdm_queue_dequeue(mcon->boost_queue);
e                 302 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 		if (e) {
e                 303 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 			bytes = (int)e->size;
e                 304 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 			memcpy(&mcon->event, e->boostmsg, bytes);
e                 305 src/ftmod/ftmod_sangoma_boost/sangoma_boost_client.c 			ftdm_safe_free(e);
e                 107 src/hashtable.c     struct entry *e;
e                 121 src/hashtable.c 				while (NULL != (e = h->table[i])) {
e                 122 src/hashtable.c 					h->table[i] = e->next;
e                 123 src/hashtable.c 					index = indexFor(newsize,e->h);
e                 124 src/hashtable.c 					e->next = newtable[index];
e                 125 src/hashtable.c 					newtable[index] = e;
e                 140 src/hashtable.c 				for (pE = &(newtable[i]), e = *pE; e != NULL; e = *pE) {
e                 141 src/hashtable.c 					index = indexFor(newsize,e->h);
e                 144 src/hashtable.c 							pE = &(e->next);
e                 148 src/hashtable.c 							*pE = e->next;
e                 149 src/hashtable.c 							e->next = newtable[index];
e                 150 src/hashtable.c 							newtable[index] = e;
e                 173 src/hashtable.c     struct entry *e;
e                 182 src/hashtable.c     e = (struct entry *)ftdm_malloc(sizeof(struct entry));
e                 183 src/hashtable.c     if (NULL == e) { --(h->entrycount); return 0; } /*oom*/
e                 184 src/hashtable.c     e->h = hash(h,k);
e                 185 src/hashtable.c     index = indexFor(h->tablelength,e->h);
e                 186 src/hashtable.c     e->k = k;
e                 187 src/hashtable.c     e->v = v;
e                 188 src/hashtable.c 	e->flags = flags;
e                 189 src/hashtable.c     e->next = h->table[index];
e                 190 src/hashtable.c     h->table[index] = e;
e                 198 src/hashtable.c     struct entry *e;
e                 202 src/hashtable.c     e = h->table[index];
e                 203 src/hashtable.c     while (NULL != e)
e                 206 src/hashtable.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k))) return e->v;
e                 207 src/hashtable.c 			e = e->next;
e                 219 src/hashtable.c     struct entry *e;
e                 227 src/hashtable.c     e = *pE;
e                 228 src/hashtable.c     while (NULL != e)
e                 231 src/hashtable.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
e                 233 src/hashtable.c 					*pE = e->next;
e                 235 src/hashtable.c 					v = e->v;
e                 236 src/hashtable.c 					if (e->flags & HASHTABLE_FLAG_FREE_KEY) {
e                 237 src/hashtable.c 						freekey(e->k);
e                 239 src/hashtable.c 					ftdm_safe_free(e);
e                 242 src/hashtable.c 			pE = &(e->next);
e                 243 src/hashtable.c 			e = e->next;
e                 254 src/hashtable.c     struct entry *e, *f;
e                 259 src/hashtable.c             e = table[i];
e                 260 src/hashtable.c             while (NULL != e)
e                 261 src/hashtable.c 				{ f = e; e = e->next; if (f->flags & HASHTABLE_FLAG_FREE_KEY) freekey(f->k); if (f->flags & HASHTABLE_FLAG_FREE_VALUE) ftdm_safe_free(f->v); ftdm_safe_free(f); }
e                 271 src/hashtable.c 	if (i->e) {
e                 272 src/hashtable.c 		if ((i->e = i->e->next) != 0) { 
e                 287 src/hashtable.c 	if ((i->e = i->h->table[i->pos]) != 0) { 
e                 297 src/hashtable.c 	h->iterator.e = NULL;
e                 306 src/hashtable.c 	if (i->e) {
e                 308 src/hashtable.c 			*key = i->e->k;
e                 311 src/hashtable.c 			*klen = (int)strlen(i->e->k);
e                 314 src/hashtable.c 			*val = i->e->v;
e                  50 src/hashtable_itr.c     itr->e = NULL;
e                  60 src/hashtable_itr.c 					itr->e = h->table[i];
e                  78 src/hashtable_itr.c     if (NULL == itr->e) return 0; /* stupidity check */
e                  80 src/hashtable_itr.c     next = itr->e->next;
e                  83 src/hashtable_itr.c 			itr->parent = itr->e;
e                  84 src/hashtable_itr.c 			itr->e = next;
e                  91 src/hashtable_itr.c 			itr->e = NULL;
e                 100 src/hashtable_itr.c 					itr->e = NULL;
e                 105 src/hashtable_itr.c     itr->e = next;
e                 127 src/hashtable_itr.c 			itr->h->table[itr->index] = itr->e->next;
e                 130 src/hashtable_itr.c         itr->parent->next = itr->e->next;
e                 133 src/hashtable_itr.c     remember_e = itr->e;
e                 150 src/hashtable_itr.c     struct entry *e, *parent;
e                 156 src/hashtable_itr.c     e = h->table[index];
e                 158 src/hashtable_itr.c     while (NULL != e)
e                 161 src/hashtable_itr.c 			if ((hashvalue == e->h) && (h->eqfn(k, e->k)))
e                 164 src/hashtable_itr.c 					itr->e = e;
e                 169 src/hashtable_itr.c 			parent = e;
e                 170 src/hashtable_itr.c 			e = e->next;
e                 539 src/include/private/ftdm_core.h FT_DECLARE(void) print_bits(uint8_t *b, int bl, char *buf, int blen, int e, uint8_t ss);
e                  17 src/include/private/hashtable_itr.h     struct entry *e;
e                  39 src/include/private/hashtable_itr.h     return i->e->k;
e                  51 src/include/private/hashtable_itr.h     return i->e->v;
e                  23 src/include/private/hashtable_private.h 	struct entry *e;
e                 346 src/libteletone_generate.c 					char *p = NULL, *e = NULL;
e                 364 src/libteletone_generate.c 							if ((e = strchr(p, ')')) != 0) {
e                 365 src/libteletone_generate.c 								*e++ = '\0';
e                 417 src/libteletone_generate.c 					if (e) {
e                 418 src/libteletone_generate.c 						cur = e;
e                 207 src/sangoma_pri.c 		if ((handler = spri->eventmap[event->e] ? spri->eventmap[event->e] : spri->eventmap[0] ? spri->eventmap[0] : NULL)) {
e                 208 src/sangoma_pri.c 			handler(spri, event->e, event);
e                 210 src/sangoma_pri.c 			fprintf(stderr,"No event handler found for event %d.\n", event->e);