last               85 src/ftdm_config.c 			int last = -1;
last               99 src/ftdm_config.c 				if ((cfg->sectno != last) && !strcmp(cfg->section, file_path)) {
last              298 src/ftdm_config.c 			if (!parent->last) {
last              300 src/ftdm_config.c 				parent->last = newnode;
last              305 src/ftdm_config.c 				sibling = parent->last;
last              307 src/ftdm_config.c 				parent->last = newnode;
last             1512 src/ftdm_io.c  static uint32_t __inline__ rr_next(uint32_t last, uint32_t min, uint32_t max, ftdm_direction_t direction)
last             1516 src/ftdm_io.c  	ftdm_log(FTDM_LOG_DEBUG, "last = %d, min = %d, max = %d\n", last, min, max);
last             1519 src/ftdm_io.c  		next = (last >= max) ? min : ++last;
last             1521 src/ftdm_io.c  		next = (last <= min) ? max : --last;
last             5927 src/ftdm_io.c  	uint32_t last;
last             5934 src/ftdm_io.c  	last = bs.byte_index;	
last             5937 src/ftdm_io.c  		if (bs.byte_index != last) {
last             5939 src/ftdm_io.c  			last = bs.byte_index;
last              287 src/include/private/ftdm_types.h 	struct ftdm_conf_node *last;
last               62 src/isdn/include/mfifo.h 	int last;                       /* last in + 1                          */
last               89 src/isdn/mfifo.c 	mf->first = mf->last = 0;
last              116 src/isdn/mfifo.c 	mf->first = mf->last = 0;
last              134 src/isdn/mfifo.c 	if (mf->last != mf->first)
last              135 src/isdn/mfifo.c 		return mf->ix[mf->last].offset;
last              158 src/isdn/mfifo.c 	if (mf->last == mf->first)
last              224 src/isdn/mfifo.c 	if (x == mf->last)
last              229 src/isdn/mfifo.c 	if (mf->last == mf->first) { /* empty queue */
last              230 src/isdn/mfifo.c 		mf->first = mf->last = 0; /* optimize */
last              268 src/isdn/mfifo.c 	if (mf->first == mf->last) {
last              272 src/isdn/mfifo.c 	*size = mf->ix[mf->last].size;
last              273 src/isdn/mfifo.c 	return &mf->buf[mf->ix[mf->last].offset];
last              292 src/isdn/mfifo.c 	if (mf->first != mf->last) {
last              293 src/isdn/mfifo.c 		x = mf->last + 1;
last              298 src/isdn/mfifo.c 		mf->last = x;
last              316 src/isdn/mfifo.c 	if (mf->first == mf->last) {
last              324 src/isdn/mfifo.c 	x = pos - mf->last;
last              342 src/isdn/mfifo.c 	if (mf->first == mf->last) {
last              345 src/isdn/mfifo.c 	else if (mf->first > mf->last) {
last              346 src/isdn/mfifo.c 		return mf->first - mf->last;
last              349 src/isdn/mfifo.c 		return (mf->ixsize - mf->last) + mf->first;
last              367 src/isdn/mfifo.c 	if (x == mf->last) {
last              369 src/isdn/mfifo.c 		mf->last++;
last              371 src/isdn/mfifo.c 		if (mf->last >= mf->ixsize)
last              372 src/isdn/mfifo.c 			mf->last = 0;
last              378 src/isdn/mfifo.c 	if (mf->last == mf->first) {	/* empty queue */
last              379 src/isdn/mfifo.c 		mf->first = mf->last = 0;	/* optimize */