/*
 * Copyright (c) 2003-2004 Tony Bybell.
 *
 * Permission is hereby granted, free of charge, to any person obtaining a
 * copy of this software and associated documentation files (the "Software"),
 * to deal in the Software without restriction, including without limitation
 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
 * and/or sell copies of the Software, and to permit persons to whom the
 * Software is furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
 * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
 * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
 * DEALINGS IN THE SOFTWARE.
 */

#include "lxt2_read.h"

/****************************************************************************/

#ifdef _WAVE_BE32

/*
 * reconstruct 8/16/24/32 bits out of the lxt's representation
 * of a big-endian integer.  this is for 32-bit PPC so no byte
 * swizzling needs to be done at all.  for 24-bit ints, we have no danger of
 * running off the end of memory provided we do the "-1" trick
 * since we'll never read a 24-bit int at the very start of a file which
 * means that we'll have a 32-bit word that we can read.
 */
   
#define lxt2_rd_get_byte(mm,offset)    ((unsigned int)(*((unsigned char *)(mm)+(offset))))
#define lxt2_rd_get_16(mm,offset)      ((unsigned int)(*((unsigned short *)(((unsigned char *)(mm))+(offset)))))
#define lxt2_rd_get_32(mm,offset)      (*(unsigned int *)(((unsigned char *)(mm))+(offset)))
#define lxt2_rd_get_24(mm,offset)      ((lxt2_rd_get_32((mm),(offset)-1)<<8)>>8)
#define lxt2_rd_get_64(mm,offset)      ((((lxtint64_t)lxt2_rd_get_32((mm),(offset)))<<32)|((lxtint64_t)lxt2_rd_get_32((mm),(offset)+4)))
 
#else

/*
 * reconstruct 8/16/24/32 bits out of the lxt's representation
 * of a big-endian integer.  x86 specific version...
 */

#if defined(__i386__) || defined(__x86_64__)

#define lxt2_rd_get_byte(mm,offset)		((unsigned int)(*((unsigned char *)(mm)+(offset))))

_LXT2_RD_INLINE static unsigned int lxt2_rd_get_16(void *mm, int offset)
{
unsigned short x = *((unsigned short *)((unsigned char *)mm+offset));

  __asm("xchgb %b0,%h0" :
        "=q" (x)        :
        "0" (x));

    return (unsigned int) x;
}

_LXT2_RD_INLINE static unsigned int lxt2_rd_get_32(void *mm, int offset)		/* note that bswap is really 486+ */
{
unsigned int x = *((unsigned int *)((unsigned char *)mm+offset));

 __asm("bswap   %0":
      "=r" (x) :
      "0" (x));

  return x;
}

#define lxt2_rd_get_24(mm,offset)  	   ((lxt2_rd_get_32((mm),(offset)-1)<<8)>>8)
#define lxt2_rd_get_64(mm,offset)      ((((lxtint64_t)lxt2_rd_get_32((mm),(offset)))<<32)|((lxtint64_t)lxt2_rd_get_32((mm),(offset)+4)))

#else

/*
 * reconstruct 8/16/24/32 bits out of the lxt's representation
 * of a big-endian integer.  this should work on all architectures.
 */
#define lxt2_rd_get_byte(mm,offset) 	((unsigned int)(*((unsigned char *)(mm)+(offset))))

static unsigned int lxt2_rd_get_16(void *mm, int offset)
{
unsigned char *nn=(unsigned char *)mm+offset;
unsigned int m1=*((unsigned char *)(nn++));
unsigned int m2=*((unsigned char *)nn);
return((m1<<8)|m2);
}

static unsigned int lxt2_rd_get_24(void *mm,int offset)
{
unsigned char *nn=(unsigned char *)mm+offset;
unsigned int m1=*((unsigned char *)(nn++));
unsigned int m2=*((unsigned char *)(nn++));
unsigned int m3=*((unsigned char *)nn);
return((m1<<16)|(m2<<8)|m3);
}

static unsigned int lxt2_rd_get_32(void *mm, int offset)
{
unsigned char *nn=(unsigned char *)mm+offset;
unsigned int m1=*((unsigned char *)(nn++));
unsigned int m2=*((unsigned char *)(nn++));
unsigned int m3=*((unsigned char *)(nn++));
unsigned int m4=*((unsigned char *)nn);
return((m1<<24)|(m2<<16)|(m3<<8)|m4);
}

static lxtint64_t lxt2_rd_get_64(void *mm, int offset)
{
return(
(((lxtint64_t)lxt2_rd_get_32(mm,offset))<<32)
|((lxtint64_t)lxt2_rd_get_32(mm,offset+4))
);
}

#endif
#endif

/****************************************************************************/

/*
 * fast SWAR ones count for 32 and 64 bits
 */
#if LXT2_RD_GRANULE_SIZE > 32

_LXT2_RD_INLINE granmsk_t
lxt2_rd_ones_cnt(granmsk_t x)
{
x -= ((x >> 1) & LXT2_RD_ULLDESC(0x5555555555555555));
x = (((x >> 2) & LXT2_RD_ULLDESC(0x3333333333333333)) + (x & LXT2_RD_ULLDESC(0x3333333333333333)));
x = (((x >> 4) + x) & LXT2_RD_ULLDESC(0x0f0f0f0f0f0f0f0f));
return((x * LXT2_RD_ULLDESC(0x0101010101010101)) >> 56);
}

#else

_LXT2_RD_INLINE granmsk_t
lxt2_rd_ones_cnt(granmsk_t x)
{
x -= ((x >> 1) & 0x55555555);
x = (((x >> 2) & 0x33333333) + (x & 0x33333333));
x = (((x >> 4) + x) & 0x0f0f0f0f);
return((x * 0x01010101) >> 24);
}

#endif


/*
 * total zero count to the right of the first rightmost one bit
 * encountered.  its intended use is to 
 * "return the bitposition of the least significant 1 in a granmsk_t"
 * (use x &= ~(x&-x) to clear out that bit quickly)
 */
_LXT2_RD_INLINE granmsk_t
lxt2_rd_tzc(granmsk_t x)
{
return (lxt2_rd_ones_cnt((x & -x) - LXT2_RD_GRAN_1VAL));
}

/****************************************************************************/

/*
 * i2c and c2i utility functions
 */
static char *lxt2_rd_expand_integer_to_bits(int len, unsigned int value)
{
static char s[33];
char *p = s;
int i;                          
int len2 = len-1;

for(i=0;i<len;i++)
        {        
        *(p++) = '0' | ((value & (1<<(len2-i)))!=0);
        }
*p = 0;  

return(s);
}


unsigned int lxt2_rd_expand_bits_to_integer(int len, char *s)
{
unsigned int v = 0;
int i;

for(i=0;i<len;i++)
	{
	v <<= 1;
	v |= ((*s) & 1);
	s++;
	}

return(v);
}


/*
 * called for all value changes except for the 1st one in a block
 * (as they're all unique based on the timeslot scheme, no duplicate
 * checking is necessary...)
 */
void lxt2_rd_iter_radix(struct lxt2_rd_trace *lt, struct lxt2_rd_block *b)
{
unsigned int which_time;
int offset;
void **top_elem;
granmsk_t msk = ~LXT2_RD_GRAN_1VAL;
lxtint32_t x;

for(which_time = 0; which_time < lt->num_time_table_entries; which_time++, msk <<= 1)
while((top_elem = lt->radix_sort[which_time]))
	{
	lxtint32_t idx = top_elem - lt->next_radix;
	unsigned int vch;
	int i;

	switch(lt->fac_curpos_width)
		{
		case 1:	vch = lxt2_rd_get_byte(lt->fac_curpos[idx], 0); break;
		case 2:	vch = lxt2_rd_get_16(lt->fac_curpos[idx], 0); break;
		case 3:	vch = lxt2_rd_get_24(lt->fac_curpos[idx], 0); break;
		case 4:	
		default:
			vch = lxt2_rd_get_32(lt->fac_curpos[idx], 0); break;
		}

	lt->fac_curpos[idx] += lt->fac_curpos_width;

	offset = lxt2_rd_tzc(lt->fac_map[idx] &= msk);		/* offset = next "which time" for this fac */

	lt->radix_sort[which_time] = lt->next_radix[idx];	/* get next list item for this "which time" bucket */

	lt->next_radix[idx] = lt->radix_sort[offset]; 		/* promote fac to its next (higher) possible bucket (if any) */
        lt->radix_sort[offset] = &lt->next_radix[idx];		/* ...and put it at the head of that list */

	switch(vch)
		{
        	case LXT2_RD_ENC_0:
        	case LXT2_RD_ENC_1:	memset(lt->value[idx], '0'+(vch-LXT2_RD_ENC_0), lt->len[idx]); break;

        	case LXT2_RD_ENC_INV:	for(i=0;i<lt->len[idx];i++) { lt->value[idx][i] ^= 1; } break;

        	case LXT2_RD_ENC_LSH0:
        	case LXT2_RD_ENC_LSH1:	memmove(lt->value[idx], lt->value[idx]+1, lt->len[idx]-1); 
					lt->value[idx][lt->len[idx]-1] = '0'+(vch-LXT2_RD_ENC_LSH0); 
					break;

        	case LXT2_RD_ENC_RSH0:
        	case LXT2_RD_ENC_RSH1:	memmove(lt->value[idx]+1, lt->value[idx], lt->len[idx]-1); 
					lt->value[idx][0] = '0'+(vch-LXT2_RD_ENC_RSH0); 
					break;

		case LXT2_RD_ENC_ADD1:
		case LXT2_RD_ENC_ADD2:
		case LXT2_RD_ENC_ADD3:
        	case LXT2_RD_ENC_ADD4:	x=lxt2_rd_expand_bits_to_integer(lt->len[idx], lt->value[idx]); x+= (vch-LXT2_RD_ENC_ADD1+1); 
					memcpy(lt->value[idx], lxt2_rd_expand_integer_to_bits(lt->len[idx], x), lt->len[idx]); break;

		case LXT2_RD_ENC_SUB1:
		case LXT2_RD_ENC_SUB2:
		case LXT2_RD_ENC_SUB3:
        	case LXT2_RD_ENC_SUB4:	x=lxt2_rd_expand_bits_to_integer(lt->len[idx], lt->value[idx]); x-= (vch-LXT2_RD_ENC_SUB1+1); 
					memcpy(lt->value[idx], lxt2_rd_expand_integer_to_bits(lt->len[idx], x), lt->len[idx]); break;

        	case LXT2_RD_ENC_X:	memset(lt->value[idx], 'x', lt->len[idx]); break;
        	case LXT2_RD_ENC_Z:	memset(lt->value[idx], 'z', lt->len[idx]); break;

		case LXT2_RD_ENC_BLACKOUT:	
					lt->value[idx][0] = 0; break;
		
		default:		vch -= LXT2_RD_DICT_START;
					if(vch >= b->num_dict_entries)
						{
						fprintf(stderr, LXT2_RDLOAD"Internal error: vch(%d) >= num_dict_entries(%d)\n", vch, b->num_dict_entries);
						exit(255);
						}

					if(lt->flags[idx] & (LXT2_RD_SYM_F_DOUBLE|LXT2_RD_SYM_F_STRING))
						{
						/* fprintf(stderr, LXT2_RDLOAD"DOUBLE: %s\n", b->string_pointers[vch]); */
						free(lt->value[idx]);
						lt->value[idx] = strdup(b->string_pointers[vch]);
						break;
						}

					if(lt->len[idx] == b->string_lens[vch])
						{
						memcpy(lt->value[idx],  b->string_pointers[vch], lt->len[idx]);
						}
					else
					if(lt->len[idx] > b->string_lens[vch])
						{
						int lendelta = lt->len[idx] - b->string_lens[vch];
				                memset(lt->value[idx], (b->string_pointers[vch][0]!='1') ?  b->string_pointers[vch][0] : '0', lendelta);
                				strcpy(lt->value[idx]+lendelta,  b->string_pointers[vch]);
						}
					else
						{
						fprintf(stderr, LXT2_RDLOAD"Internal error %d ('%s') vs %d ('%s')\n", 
							lt->len[idx], lt->value[idx], 
							b->string_lens[vch], b->string_pointers[vch]);
						exit(255);
						}
					
					break;
		}

	/* this string is _always_ unique */
	/* fprintf(stderr, LXT2_RDLOAD"%lld : [%d] '%s'\n", lt->time_table[which_time], idx, lt->value[idx]); */

	if(lt->time_table[which_time] != lt->prev_time)
		{
		lt->prev_time = lt->time_table[which_time];
		}

	lt->value_change_callback(&lt, &lt->time_table[which_time], &idx, &lt->value[idx]);
	}
}


/*
 * called for only 1st vch in a block: blocks out emission of duplicate
 * vch from preceeding block
 */
void lxt2_rd_iter_radix0(struct lxt2_rd_trace *lt, struct lxt2_rd_block *b, lxtint32_t idx)
{
	unsigned int vch;
	unsigned int which_time;
	int i;
	int uniq = 0;

	switch(lt->fac_curpos_width)
		{
		case 1:	vch = lxt2_rd_get_byte(lt->fac_curpos[idx], 0); break;
		case 2:	vch = lxt2_rd_get_16(lt->fac_curpos[idx], 0); break;
		case 3:	vch = lxt2_rd_get_24(lt->fac_curpos[idx], 0); break;
		case 4:	
		default:
			vch = lxt2_rd_get_32(lt->fac_curpos[idx], 0); break;
		}

	lt->fac_curpos[idx] += lt->fac_curpos_width;
	which_time = 0;

	switch(vch)
		{
        	case LXT2_RD_ENC_0:		for(i=0;i<lt->len[idx];i++)
						{
						if(lt->value[idx][i]!='0')
							{
							memset(lt->value[idx]+i, '0', lt->len[idx] - i);
							uniq = 1;
							break;
							}
						}
					break;

        	case LXT2_RD_ENC_1:		for(i=0;i<lt->len[idx];i++)
						{
						if(lt->value[idx][i]!='1')
							{
							memset(lt->value[idx]+i, '1', lt->len[idx] - i);
							uniq = 1;
							break;
							}
						}
					break;

        	case LXT2_RD_ENC_INV:
        	case LXT2_RD_ENC_LSH0:
        	case LXT2_RD_ENC_LSH1:
        	case LXT2_RD_ENC_RSH0:
        	case LXT2_RD_ENC_RSH1:
		case LXT2_RD_ENC_ADD1:
		case LXT2_RD_ENC_ADD2:
		case LXT2_RD_ENC_ADD3:
        	case LXT2_RD_ENC_ADD4:
		case LXT2_RD_ENC_SUB1:
		case LXT2_RD_ENC_SUB2:
		case LXT2_RD_ENC_SUB3:
        	case LXT2_RD_ENC_SUB4:	fprintf(stderr, LXT2_RDLOAD"Internal error in granule 0 position 0\n");
					exit(255);

        	case LXT2_RD_ENC_X:	for(i=0;i<lt->len[idx];i++)
						{
						if(lt->value[idx][i]!='x')
							{
							memset(lt->value[idx]+i, 'x', lt->len[idx] - i);
							uniq = 1;
							break;
							}
						}
					break;

        	case LXT2_RD_ENC_Z:	for(i=0;i<lt->len[idx];i++)
						{
						if(lt->value[idx][i]!='z')
							{
							memset(lt->value[idx]+i, 'z', lt->len[idx] - i);
							uniq = 1;
							break;
							}
						}
					break;

		case LXT2_RD_ENC_BLACKOUT:	
					if(lt->value[idx])
						{
						lt->value[idx][0] = 0; 
						uniq=1;
						}
					break;

		default:		vch -= LXT2_RD_DICT_START;
					if(vch >= b->num_dict_entries)
						{
						fprintf(stderr, LXT2_RDLOAD"Internal error: vch(%d) >= num_dict_entries(%d)\n", vch, b->num_dict_entries);
						exit(255);
						}

					if(lt->flags[idx] & (LXT2_RD_SYM_F_DOUBLE|LXT2_RD_SYM_F_STRING))
						{
						/* fprintf(stderr, LXT2_RDLOAD"DOUBLE: %s\n", b->string_pointers[vch]); */
						if(strcmp(lt->value[idx], b->string_pointers[vch]))
							{
							free(lt->value[idx]);
							lt->value[idx] = strdup(b->string_pointers[vch]);
							uniq = 1;
							}
						break;
						}

					if(lt->len[idx] == b->string_lens[vch])
						{
						for(i=0;i<lt->len[idx];i++)
							{
							if(lt->value[idx][i] != b->string_pointers[vch][i])
								{
								memcpy(lt->value[idx]+i,  b->string_pointers[vch]+i, lt->len[idx]-i);
								uniq = 1;
								}
							}
						}
					else
					if(lt->len[idx] > b->string_lens[vch])
						{
						int lendelta = lt->len[idx] - b->string_lens[vch];
						int fill = (b->string_pointers[vch][0]!='1') ?  b->string_pointers[vch][0] : '0';

						for(i=0;i<lendelta;i++)
							{
							if (lt->value[idx][i] != fill)
								{
								memset(lt->value[idx] + i, fill, lendelta - i);
		                				strcpy(lt->value[idx]+lendelta,  b->string_pointers[vch]);
								uniq = 1;
								goto fini;
								}
							}

						for(i=lendelta;i<lt->len[idx];i++)
							{
							if(lt->value[idx][i] != b->string_pointers[vch][i-lendelta])
								{
								memcpy(lt->value[idx]+i,  b->string_pointers[vch]+i-lendelta, lt->len[idx]-i);
								uniq = 1;
								}
							}
						}
					else
						{
						fprintf(stderr, LXT2_RDLOAD"Internal error %d ('%s') vs %d ('%s')\n", 
							lt->len[idx], lt->value[idx], 
							b->string_lens[vch], b->string_pointers[vch]);
						exit(255);
						}
					
					break;
		}


	/* this string is unique if uniq != 0 */
	/* fprintf(stderr, LXT2_RDLOAD"%lld : [%d] '%s'\n", lt->time_table[which_time], idx, lt->value[idx]); */
fini:	if(uniq)
		{
		if(lt->time_table[which_time] != lt->prev_time)
			{
			lt->prev_time = lt->time_table[which_time];
			}

		lt->value_change_callback(&lt, &lt->time_table[which_time], &idx, &lt->value[idx]);
		}
}


/*
 * radix sort the fac entries based upon their first entry in the
 * time change table.  this runs in strict linear time: we can
 * do this because of the limited domain of the dataset.
 */
static void lxt2_rd_build_radix(struct lxt2_rd_trace *lt, struct lxt2_rd_block *b, int granule,
		lxtint32_t strtfac, lxtint32_t endfac)
{
int i;
int offset;

for(i=0;i<LXT2_RD_GRANULE_SIZE+1;i++)	/* +1 because tzc returns 33/65 when its arg == 0 */
	{
	lt->radix_sort[i] = NULL;	/* each one is a linked list: we get fac number based on address of item from lt->next_radix */
	}

for(i=strtfac;i<endfac;i++)
	{
	granmsk_t x;
	int process_idx = i/8;
	int process_bit = i&7;

	if(lt->process_mask[process_idx]&(1<<process_bit))
		{
		if((x=lt->fac_map[i]))
			{
			if((!granule)&&(x&LXT2_RD_GRAN_1VAL))
				{
				lxt2_rd_iter_radix0(lt, b, i);		/* emit vcd only if it's unique */
				x&=(~LXT2_RD_GRAN_1VAL);		/* clear out least sig bit */
				lt->fac_map[i] = x;
				if(!x) continue;
				}
		
			offset = lxt2_rd_tzc(x);			/* get "which time" bucket number of new least sig one bit */
			lt->next_radix[i] = lt->radix_sort[offset];	/* insert item into head of radix sorted "which time" buckets */
			lt->radix_sort[offset] = &lt->next_radix[i];
			}
		}
	}
}

/****************************************************************************/

/*
 * build compressed process mask if necessary
 */
static void lxt2_rd_regenerate_process_mask(struct lxt2_rd_trace *lt)
{
int i, j, lim, idx;

if((lt)&&(lt->process_mask_dirty))
	{
	lt->process_mask_dirty = 0;
	idx=0;
	for(i=0;i<lt->numrealfacs;i+=LXT2_RD_PARTIAL_SIZE)
		{
		if(i+LXT2_RD_PARTIAL_SIZE>lt->numrealfacs)
			{
			lim = lt->numrealfacs;
			}
			else
			{
			lim = i+LXT2_RD_PARTIAL_SIZE;
			}
	
		lt->process_mask_compressed[idx] = 0;
		for(j=i;j<lim;j++)
			{
			int process_idx = j/8;		/* no need to optimize this */
			int process_bit = j&7;

			if(lt->process_mask[process_idx]&(1<<process_bit))
				{
				lt->process_mask_compressed[idx] = 1;
				break;
				}
			}

		idx++;
		}
	}
}

/****************************************************************************/


/*
 * process a single block and execute the vch callback as necessary
 */
int lxt2_rd_process_block(struct lxt2_rd_trace *lt, struct lxt2_rd_block *b)
{
char vld;
char *pnt;
int i;
int granule = 0;
char sect_typ;
lxtint32_t strtfac_gran=0;
char granvld=0;

b->num_map_entries = lxt2_rd_get_32(b->mem, b->uncompressed_siz - 4);
b->num_dict_entries = lxt2_rd_get_32(b->mem, b->uncompressed_siz - 12);

#if LXT2_RD_GRANULE_SIZE > 32
if(lt->granule_size==LXT2_RD_GRANULE_SIZE)
	{
	b->map_start = (b->mem + b->uncompressed_siz - 12) - sizeof(granmsk_t) * b->num_map_entries;
	}
	else
	{
	b->map_start = (b->mem + b->uncompressed_siz - 12) - sizeof(granmsk_smaller_t) * b->num_map_entries;
	}

#else
	b->map_start = (b->mem + b->uncompressed_siz - 12) - sizeof(granmsk_t) * b->num_map_entries;
#endif

b->dict_start = b->map_start - lxt2_rd_get_32(b->mem, b->uncompressed_siz - 8);

/* fprintf(stderr, LXT2_RDLOAD"num_map_entries: %d, num_dict_entries: %d, map_start: %08x, dict_start: %08x, mem: %08x end: %08x\n",
	b->num_map_entries, b->num_dict_entries, b->map_start, b->dict_start, b->mem, b->mem+b->uncompressed_siz); */

vld = lxt2_rd_get_byte(b->dict_start - 1, 0);
if(vld != LXT2_RD_GRAN_SECT_DICT)
	{
	fprintf(stderr, LXT2_RDLOAD"Malformed section\n");
	exit(255);
	}

if(b->num_dict_entries)
	{
	b->string_pointers = malloc(b->num_dict_entries * sizeof(char *));
	b->string_lens = malloc(b->num_dict_entries * sizeof(unsigned int));
	pnt = b->dict_start;
	for(i=0;i<b->num_dict_entries;i++)
		{
		b->string_pointers[i] = pnt;
		b->string_lens[i] = strlen(pnt);
		pnt += (b->string_lens[i] + 1);
		/* fprintf(stderr, LXT2_RDLOAD"%d '%s'\n", i, b->string_pointers[i]); */
		}

	if(pnt!=b->map_start)
		{
		fprintf(stderr, LXT2_RDLOAD"dictionary corrupt, exiting\n");
		exit(255);
		}
	}

pnt = b->mem;
while(((sect_typ=*pnt) == LXT2_RD_GRAN_SECT_TIME)||(sect_typ == LXT2_RD_GRAN_SECT_TIME_PARTIAL))
	{
	lxtint32_t strtfac, endfac;

	if(sect_typ == LXT2_RD_GRAN_SECT_TIME_PARTIAL)
		{
		lxtint32_t sublen;

		lxt2_rd_regenerate_process_mask(lt);

		strtfac = lxt2_rd_get_32(pnt, 1);
		sublen = lxt2_rd_get_32(pnt, 5);

		if(!granvld)
			{
			granvld=1;
			strtfac_gran = strtfac;
			}
		else
			{
			granule += (strtfac==strtfac_gran);
			}

		if(!lt->process_mask_compressed[strtfac/LXT2_RD_PARTIAL_SIZE])
			{
			/* fprintf(stderr, "skipping group %d for %d bytes\n", strtfac, sublen); */
			pnt += 9;
			pnt += sublen;
			continue;
			}

		/* fprintf(stderr, "processing group %d for %d bytes\n", strtfac, sublen); */
		endfac=strtfac+LXT2_RD_PARTIAL_SIZE;
		if(endfac>lt->numrealfacs) endfac=lt->numrealfacs;
		pnt += 8;
		}
		else
		{
		strtfac=0;
		endfac=lt->numrealfacs;
		}

	/* fprintf(stderr, LXT2_RDLOAD"processing granule %d\n", granule); */
	pnt++;
	lt->num_time_table_entries = lxt2_rd_get_byte(pnt, 0);
	pnt++;
	for(i=0;i<lt->num_time_table_entries;i++)
		{
		lt->time_table[i] = lxt2_rd_get_64(pnt, 0);
		pnt+=8;
		/* fprintf(stderr, LXT2_RDLOAD"\t%d) %lld\n", i, lt->time_table[i]); */
		}

	lt->fac_map_index_width = lxt2_rd_get_byte(pnt, 0);
	if((!lt->fac_map_index_width)||(lt->fac_map_index_width > 4))
		{
		fprintf(stderr, LXT2_RDLOAD"Map index width of %d is illegal, exiting.\n", lt->fac_map_index_width);
		exit(255);
		}
	pnt++;

	for(i=strtfac;i<endfac;i++)
		{
		lxtint32_t mskindx;

		switch(lt->fac_map_index_width)
			{
			case 1: mskindx = lxt2_rd_get_byte(pnt, 0); break;
			case 2: mskindx = lxt2_rd_get_16(pnt, 0); break;
			case 3: mskindx = lxt2_rd_get_24(pnt, 0); break;
			case 4: 
			default:
				mskindx = lxt2_rd_get_32(pnt, 0); break;
			}

		pnt += lt->fac_map_index_width;

#if LXT2_RD_GRANULE_SIZE > 32
		if(lt->granule_size==LXT2_RD_GRANULE_SIZE)
			{
			lt->fac_map[i] = get_fac_msk(b->map_start, mskindx * sizeof(granmsk_t));
			}
			else
			{
			lt->fac_map[i] = get_fac_msk_smaller(b->map_start, mskindx * sizeof(granmsk_smaller_t));
			}
#else
		lt->fac_map[i] = get_fac_msk(b->map_start, mskindx * sizeof(granmsk_t));
#endif
		}

	lt->fac_curpos_width = lxt2_rd_get_byte(pnt, 0);
	if((!lt->fac_curpos_width)||(lt->fac_curpos_width > 4))
		{
		fprintf(stderr, LXT2_RDLOAD"Curpos index width of %d is illegal, exiting.\n", lt->fac_curpos_width);
		exit(255);
		}
	pnt++;

	for(i=strtfac;i<endfac;i++)
		{
		lt->fac_curpos[i] = pnt;
		if(lt->fac_map[i])
			{
			pnt += (lxt2_rd_ones_cnt(lt->fac_map[i]) * lt->fac_curpos_width);
			}
		}

	lxt2_rd_build_radix(lt, b, granule, strtfac, endfac);
	lxt2_rd_iter_radix(lt, b);

	if(sect_typ != LXT2_RD_GRAN_SECT_TIME_PARTIAL)
		{
		granule++;
		}
	}

return(1);
}


/****************************************************************************/

/*
 * null callback used when a user passes NULL as an argument to lxt2_rd_iter_blocks()
 */
void lxt2_rd_null_callback(struct lxt2_rd_trace **lt, lxtint64_t *pnt_time, lxtint32_t *pnt_facidx, char **pnt_value)
{
/* fprintf(stderr, LXT2_RDLOAD"%lld %d %s\n", *pnt_time, *pnt_facidx, *pnt_value); */
}

/****************************************************************************/

/*
 * initialize the trace, get compressed facnames, get geometries,
 * and get block offset/size/timestart/timeend...
 */
struct lxt2_rd_trace *lxt2_rd_init(const char *name)
{
struct lxt2_rd_trace *lt=(struct lxt2_rd_trace *)calloc(1, sizeof(struct lxt2_rd_trace));
int i;

if(!(lt->handle=fopen(name, "rb")))
        {
	lxt2_rd_close(lt);
        lt=NULL;
        }
        else
	{
	lxtint16_t id = 0, version = 0;

	lt->block_mem_max = LXT2_RD_MAX_BLOCK_MEM_USAGE;    /* cutoff after this number of bytes and force flush */

	setvbuf(lt->handle, (char *)NULL, _IONBF, 0);	/* keeps gzip from acting weird in tandem with fopen */

	fread(&id, 2, 1, lt->handle);
	fread(&version, 2, 1, lt->handle);
	fread(&lt->granule_size, 1, 1, lt->handle);
	
	if(lxt2_rd_get_16(&id,0) != LXT2_RD_HDRID)
		{
		fprintf(stderr, LXT2_RDLOAD"*** Not an lxt file ***\n");
		lxt2_rd_close(lt);
	        lt=NULL;
		}
	else
	if((version=lxt2_rd_get_16(&version,0)) > LXT2_RD_VERSION)
		{
		fprintf(stderr, LXT2_RDLOAD"*** Version %d lxt not supported ***\n", version);
		lxt2_rd_close(lt);
	        lt=NULL;
		}
	else
	if(lt->granule_size > LXT2_RD_GRANULE_SIZE)
		{
		fprintf(stderr, LXT2_RDLOAD"*** Granule size of %d (>%d) not supported ***\n", lt->granule_size, LXT2_RD_GRANULE_SIZE);
		lxt2_rd_close(lt);
	        lt=NULL;
		}
	else
		{
		int rc;
		char *m;
		off_t pos, fend;
		int t;
		struct lxt2_rd_block *b;

		fread(&lt->numfacs, 4, 1, lt->handle);			lt->numfacs = lxt2_rd_get_32(&lt->numfacs,0);
		fread(&lt->numfacbytes, 4, 1, lt->handle);		lt->numfacbytes = lxt2_rd_get_32(&lt->numfacbytes,0);
		fread(&lt->longestname, 4, 1, lt->handle);		lt->longestname = lxt2_rd_get_32(&lt->longestname,0);
		fread(&lt->zfacnamesize, 4, 1, lt->handle);		lt->zfacnamesize = lxt2_rd_get_32(&lt->zfacnamesize,0);
		fread(&lt->zfacname_predec_size, 4, 1, lt->handle); 	lt->zfacname_predec_size = lxt2_rd_get_32(&lt->zfacname_predec_size,0);
		fread(&lt->zfacgeometrysize, 4, 1, lt->handle);		lt->zfacgeometrysize = lxt2_rd_get_32(&lt->zfacgeometrysize,0);
		fread(&lt->timescale, 1, 1, lt->handle);		/* no swap necessary */

		fprintf(stderr, LXT2_RDLOAD"%d facilities\n", lt->numfacs);
		pos = ftello(lt->handle);
		/* fprintf(stderr, LXT2_RDLOAD"gzip facnames start at pos %d (zsize=%d)\n", pos, lt->zfacnamesize); */

		lt->process_mask = calloc(1, lt->numfacs/8+1);
		lt->process_mask_compressed = calloc(1, lt->numfacs/LXT2_RD_PARTIAL_SIZE+1);

		lt->zhandle = gzdopen(dup(fileno(lt->handle)), "rb");
		m=(char *)malloc(lt->zfacname_predec_size);
		rc=gzread(lt->zhandle, m, lt->zfacname_predec_size);
		gzclose(lt->zhandle); lt->zhandle=NULL;

		if(rc!=lt->zfacname_predec_size)
			{
			fprintf(stderr, LXT2_RDLOAD"*** name section mangled %d (act) vs %d (exp)\n", rc, lt->zfacname_predec_size);
			free(m);

			lxt2_rd_close(lt);
		        lt=NULL;
			return(lt);
			}

		lt->zfacnames = m;

                lt->faccache = calloc(1, sizeof(struct lxt2_rd_facname_cache));
                lt->faccache->old_facidx = lt->numfacs;   /* causes lxt2_rd_get_facname to initialize its unroll ptr as this is always invalid */
                lt->faccache->bufcurr = malloc(lt->longestname+1);
                lt->faccache->bufprev = malloc(lt->longestname+1);

		fseeko(lt->handle, pos = pos+lt->zfacnamesize, SEEK_SET);
		/* fprintf(stderr, LXT2_RDLOAD"seeking to geometry at %d (0x%08x)\n", pos, pos); */
		lt->zhandle = gzdopen(dup(fileno(lt->handle)), "rb");

		t = lt->numfacs * 4 * sizeof(lxtint32_t);
		m=(char *)malloc(t);				
		rc=gzread(lt->zhandle, m, t);
		gzclose(lt->zhandle); lt->zhandle=NULL;
		if(rc!=t)
			{
			fprintf(stderr, LXT2_RDLOAD"*** geometry section mangled %d (act) vs %d (exp)\n", rc, t);
			free(m);

			lxt2_rd_close(lt);
		        lt=NULL;
			return(lt);
			}

		pos = pos+lt->zfacgeometrysize;

		lt->rows = malloc(lt->numfacs * sizeof(lxtint32_t));
		lt->msb = malloc(lt->numfacs * sizeof(lxtint32_t));
		lt->lsb = malloc(lt->numfacs * sizeof(lxtint32_t));
		lt->flags = malloc(lt->numfacs * sizeof(lxtint32_t));
		lt->len = malloc(lt->numfacs * sizeof(lxtint32_t));
		lt->value = malloc(lt->numfacs * sizeof(char *));
		lt->next_radix = malloc(lt->numfacs * sizeof(void *));

		for(i=0;i<lt->numfacs;i++)
			{
			lt->rows[i] = lxt2_rd_get_32(m+i*16, 0);
			lt->msb[i] = lxt2_rd_get_32(m+i*16, 4);
			lt->lsb[i] = lxt2_rd_get_32(m+i*16, 8);
			lt->flags[i] = lxt2_rd_get_32(m+i*16, 12);

			if(!(lt->flags[i] & LXT2_RD_SYM_F_INTEGER))
				{
				lt->len[i] = (lt->msb[i] <= lt->lsb[i]) ? (lt->lsb[i] - lt->msb[i] + 1) : (lt->msb[i] - lt->lsb[i] + 1);
				}
				else
				{
				lt->len[i] = 32;
				}
			lt->value[i] = calloc(lt->len[i] + 1, sizeof(char));
			}

		for(lt->numrealfacs=0; lt->numrealfacs<lt->numfacs; lt->numrealfacs++)
			{
			if(lt->flags[lt->numrealfacs] & LXT2_RD_SYM_F_ALIAS)
				{
				break;
				}
			}
		if(lt->numrealfacs > lt->numfacs) lt->numrealfacs = lt->numfacs;

		lt->prev_time = ~(LXT2_RD_GRAN_0VAL);
		free(m);

		lt->fac_map = malloc(lt->numfacs * sizeof(granmsk_t));
		lt->fac_curpos = malloc(lt->numfacs * sizeof(char *));

		for(;;)
			{
			fseeko(lt->handle, 0L, SEEK_END);
			fend=ftello(lt->handle);
			if(pos>=fend) break;

			fseeko(lt->handle, pos, SEEK_SET);
			/* fprintf(stderr, LXT2_RDLOAD"seeking to block at %d (0x%08x)\n", pos, pos); */

			b=calloc(1, sizeof(struct lxt2_rd_block));
		
			fread(&b->uncompressed_siz, 4, 1, lt->handle);			b->uncompressed_siz = lxt2_rd_get_32(&b->uncompressed_siz,0);
			fread(&b->compressed_siz, 4, 1, lt->handle);			b->compressed_siz = lxt2_rd_get_32(&b->compressed_siz,0);
			fread(&b->start, 8, 1, lt->handle);				b->start = lxt2_rd_get_64(&b->start,0);
			fread(&b->end, 8, 1, lt->handle);				b->end = lxt2_rd_get_64(&b->end,0);
			pos = ftello(lt->handle);
			fseeko(lt->handle, pos, SEEK_SET);
			/* fprintf(stderr, LXT2_RDLOAD"block gzip start at pos %d (0x%08x)\n", pos, pos); */
			if(pos>=fend)
				{
				free(b);
				break;
				}

			b->filepos = pos; /* mark startpos for later in case we purge it from memory */	
			/* fprintf(stderr, LXT2_RDLOAD"un/compressed size: %d/%d\n", b->uncompressed_siz, b->compressed_siz); */
	
			if((b->uncompressed_siz)&&(b->compressed_siz)&&(b->end))
				{
				/* fprintf(stderr, LXT2_RDLOAD"block [%d] %lld / %lld\n", lt->numblocks, b->start, b->end); */
				fseeko(lt->handle, b->compressed_siz, SEEK_CUR);

				lt->numblocks++;
				if(lt->block_curr)
					{
					lt->block_curr->next = b;
					lt->block_curr = b;
					lt->end = b->end;
					}
					else
					{
					lt->block_head = lt->block_curr = b;
					lt->start = b->start;
					lt->end = b->end;
					}			
				}
				else
				{
				free(b);
				break;
				}
	
			pos+=b->compressed_siz;
			}

		if(lt->numblocks)
			{
			fprintf(stderr, LXT2_RDLOAD"Read %d block header%s OK\n", lt->numblocks, (lt->numblocks!=1) ? "s" : "");

			fprintf(stderr, LXT2_RDLOAD"["LXT2_RD_LLD"] start time\n", lt->start);
			fprintf(stderr, LXT2_RDLOAD"["LXT2_RD_LLD"] end time\n", lt->end);
			fprintf(stderr, LXT2_RDLOAD"\n");

			lt->value_change_callback = lxt2_rd_null_callback;
			}
			else
			{
			lxt2_rd_close(lt);
			lt=NULL;
			}
		}
	}

return(lt);
}


/*
 * free up/deallocate any resources still left out there:
 * blindly do it based on NULL pointer comparisons (ok, since
 * calloc() is used to allocate all structs) as performance
 * isn't an issue for this set of cleanup code
 */
void lxt2_rd_close(struct lxt2_rd_trace *lt)
{
if(lt)
	{
	struct lxt2_rd_block *b, *bt;
	int i;

	if(lt->process_mask) { free(lt->process_mask); lt->process_mask=NULL; }
	if(lt->process_mask_compressed) { free(lt->process_mask_compressed); lt->process_mask_compressed=NULL; }

	if(lt->rows) { free(lt->rows); lt->rows=NULL; }
	if(lt->msb) { free(lt->msb); lt->msb=NULL; }
	if(lt->lsb) { free(lt->lsb); lt->lsb=NULL; }
	if(lt->flags) { free(lt->flags); lt->flags=NULL; }
	if(lt->len) { free(lt->len); lt->len=NULL; }
	if(lt->next_radix) { free(lt->next_radix); lt->next_radix=NULL; }

	for(i=0;i<lt->numfacs;i++)
		{
		if(lt->value[i])
			{		
			free(lt->value[i]); lt->value[i]=NULL; 
			}
		}

	if(lt->value) { free(lt->value); lt->value=NULL; }

	if(lt->zfacnames) { free(lt->zfacnames); lt->zfacnames=NULL; }

	if(lt->faccache)
		{
		if(lt->faccache->bufprev) { free(lt->faccache->bufprev); lt->faccache->bufprev=NULL; }
		if(lt->faccache->bufcurr) { free(lt->faccache->bufcurr); lt->faccache->bufcurr=NULL; }

		free(lt->faccache); lt->faccache=NULL;
		}

	if(lt->fac_map) { free(lt->fac_map); lt->fac_map=NULL; }
	if(lt->fac_curpos) { free(lt->fac_curpos); lt->fac_curpos=NULL; }

	b=lt->block_head;
	while(b)
		{
		bt=b->next;

		if(b->mem) { free(b->mem); b->mem=NULL; }

		if(b->string_pointers) { free(b->string_pointers); b->string_pointers=NULL; }
		if(b->string_lens) { free(b->string_lens); b->string_lens=NULL; }

		free(b);
		b=bt;
		}

	lt->block_head=lt->block_curr=NULL;

	if(lt->zhandle) { gzclose(lt->zhandle); lt->zhandle=NULL; }
	if(lt->handle) { fclose(lt->handle); lt->handle=NULL; }
	free(lt);	
	}
}

/****************************************************************************/

/* 
 * return number of facs in trace
 */
_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_num_facs(struct lxt2_rd_trace *lt)
{
return(lt ? lt->numfacs : 0);
}


/*
 * return fac geometry for a given index
 */
struct lxt2_rd_geometry *lxt2_rd_get_fac_geometry(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	lt->geometry.rows = lt->rows[facidx];	
	lt->geometry.msb = lt->msb[facidx];	
	lt->geometry.lsb = lt->lsb[facidx];	
	lt->geometry.flags = lt->flags[facidx];	
	lt->geometry.len = lt->len[facidx];	
	return(&lt->geometry);
	}
	else
	{
	return(NULL);
	}
}


/*
 * return partial fac geometry for a given index
 */
_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_fac_rows(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	return(lt->rows[facidx]);
	}
	else
	{
	return(0);
	}
}


_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_fac_msb(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	return(lt->msb[facidx]);
	}
	else
	{
	return(0);
	}
}


_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_fac_lsb(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	return(lt->lsb[facidx]);
	}
	else
	{
	return(0);
	}
}


_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_fac_flags(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	return(lt->flags[facidx]);
	}
	else
	{
	return(0);
	}
}


_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_fac_len(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	return(lt->len[facidx]);
	}
	else
	{
	return(0);
	}
}


_LXT2_RD_INLINE lxtint32_t lxt2_rd_get_alias_root(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if((lt)&&(facidx<lt->numfacs))
	{
	while(lt->flags[facidx] & LXT2_RD_SYM_F_ALIAS)
		{
		facidx = lt->rows[facidx];	/* iterate to next alias */
		}
	return(facidx);
	}
	else
	{
	return(~((lxtint32_t)0));
	}
}


/*
 * time queries
 */ 
_LXT2_RD_INLINE lxtint64_t lxt2_rd_get_start_time(struct lxt2_rd_trace *lt)
{
return(lt ? lt->start : LXT2_RD_GRAN_0VAL);
}


_LXT2_RD_INLINE lxtint64_t lxt2_rd_get_end_time(struct lxt2_rd_trace *lt)
{
return(lt ? lt->end : LXT2_RD_GRAN_0VAL);
}


_LXT2_RD_INLINE char lxt2_rd_get_timescale(struct lxt2_rd_trace *lt)
{
return(lt ? lt->timescale : 0);
}


/*
 * extract facname from prefix-compressed table.  this
 * performs best when extracting facs with monotonically
 * increasing indices...
 */
char *lxt2_rd_get_facname(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
char *pnt;
int clone, j;

if(lt)
	{
	if((facidx==(lt->faccache->old_facidx+1))||(!facidx))
		{
		if(!facidx)
			{
			lt->faccache->n = lt->zfacnames;
			lt->faccache->bufcurr[0] = 0;			
			lt->faccache->bufprev[0] = 0;			
			}

		if(facidx!=lt->numfacs)
			{
			pnt = lt->faccache->bufcurr;
			lt->faccache->bufcurr = lt->faccache->bufprev;
			lt->faccache->bufprev = pnt;

			clone=lxt2_rd_get_16(lt->faccache->n, 0);  lt->faccache->n+=2;
			pnt=lt->faccache->bufcurr;

			for(j=0;j<clone;j++)
				{
				*(pnt++) = lt->faccache->bufprev[j];
				}

			while((*(pnt++)=lxt2_rd_get_byte(lt->faccache->n++,0)));
			lt->faccache->old_facidx = facidx;
			return(lt->faccache->bufcurr);
			}
			else
			{
			return(NULL);	/* no more left */
			}
		}
		else
		{
		if(facidx<lt->numfacs)
			{		
			int strt;

			if(facidx==lt->faccache->old_facidx)
				{
				return(lt->faccache->bufcurr);
				}

			if(facidx>(lt->faccache->old_facidx+1))
				{
				strt = lt->faccache->old_facidx+1;
				}
				else
				{
				strt=0;
				}

			for(j=strt;j<facidx;j++)
				{
				lxt2_rd_get_facname(lt, j);
				}
	
			return(lxt2_rd_get_facname(lt, j));
			}
		}
	}

return(NULL);
}


/*
 * iter mask manipulation util functions
 */
_LXT2_RD_INLINE int lxt2_rd_get_fac_process_mask(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
if(lt)
	{
	if(facidx<lt->numfacs)
		{
		int process_idx = facidx/8;
		int process_bit = facidx&7;

		return( (lt->process_mask[process_idx]&(1<<process_bit)) != 0 );
		}
	}
return(0);
}


_LXT2_RD_INLINE int lxt2_rd_set_fac_process_mask(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
int rc=0;

if(lt)
	{
	lt->process_mask_dirty = 1;
	if(facidx<lt->numfacs)
		{
		int idx = facidx/8;
		int bitpos = facidx&7;

		lt->process_mask[idx] |= (1<<bitpos);
		}
	rc=1;
	}

return(rc);
}


_LXT2_RD_INLINE int lxt2_rd_clr_fac_process_mask(struct lxt2_rd_trace *lt, lxtint32_t facidx)
{
int rc=0;

if(lt)
	{
	lt->process_mask_dirty = 1;
	if(facidx<lt->numfacs)
		{
		int idx = facidx/8;
		int bitpos = facidx&7;

		lt->process_mask[idx] &= (~(1<<bitpos));
		}
	rc=1;
	}

return(rc);
}


_LXT2_RD_INLINE int lxt2_rd_set_fac_process_mask_all(struct lxt2_rd_trace *lt)
{
int rc=0;

if(lt)
	{
	lt->process_mask_dirty = 1;
	memset(lt->process_mask, 0xff, (lt->numfacs+7)/8);
	rc=1;
	}

return(rc);
}


_LXT2_RD_INLINE int lxt2_rd_clr_fac_process_mask_all(struct lxt2_rd_trace *lt)
{
int rc=0;

if(lt)
	{
	lt->process_mask_dirty = 1;
	memset(lt->process_mask, 0x00, (lt->numfacs+7)/8);
	rc=1;
	}

return(rc);
}


/*
 * block memory set/get used to control buffering
 */
_LXT2_RD_INLINE lxtint64_t lxt2_rd_set_max_block_mem_usage(struct lxt2_rd_trace *lt, lxtint64_t block_mem_max)
{
lxtint64_t rc = lt->block_mem_max;
lt->block_mem_max = block_mem_max;
return(rc);
}


_LXT2_RD_INLINE lxtint64_t lxt2_rd_get_block_mem_usage(struct lxt2_rd_trace *lt)
{
return(lt->block_mem_consumed);
}


/*
 * return total number of blocks
 */
_LXT2_RD_INLINE unsigned int lxt2_rd_get_num_blocks(struct lxt2_rd_trace *lt)
{
return(lt->numblocks);
}

/*
 * return number of active blocks
 */
unsigned int lxt2_rd_get_num_active_blocks(struct lxt2_rd_trace *lt)
{
int blk=0;

if(lt)
	{
	struct lxt2_rd_block *b = lt->block_head;

	while(b)
		{
		if((!b->short_read_ignore)&&(!b->exclude_block))
			{
			blk++;
			}

		b=b->next;
		}
	}

return(blk);
}

/****************************************************************************/

/*
 * block iteration...purge/reload code here isn't sophisticated as it
 * merely caches the FIRST set of blocks which fit in lt->block_mem_max.
 * n.b., returns number of blocks processed
 */
int lxt2_rd_iter_blocks(struct lxt2_rd_trace *lt, 
	void (*value_change_callback)(struct lxt2_rd_trace **lt, lxtint64_t *time, lxtint32_t *facidx, char **value),
	void *user_callback_data_pointer)
{
struct lxt2_rd_block *b;
int blk=0, blkfinal=0;
int processed = 0;
struct lxt2_rd_block *bcutoff=NULL, *bfinal=NULL;
int striped_kill = 0;
unsigned int real_uncompressed_siz = 0;
unsigned char gzid[2];

if(lt)
	{
	lt->value_change_callback = value_change_callback ? value_change_callback : lxt2_rd_null_callback; 
	lt->user_callback_data_pointer = user_callback_data_pointer;

	b = lt->block_head;
	blk=0;

	while(b)
		{
		if((!b->mem)&&(!b->short_read_ignore)&&(!b->exclude_block))
			{
			int rc;

			if(processed<5)
				{
				int gate = (processed==4) && b->next;
				fprintf(stderr, LXT2_RDLOAD"block [%d] processing "LXT2_RD_LLD" / "LXT2_RD_LLD"%s\n", blk, b->start, b->end, gate ? " ..." : "");
				if(gate) { bcutoff = b; }
				}

			processed++;

			fseeko(lt->handle, b->filepos, SEEK_SET);
			gzid[0]=gzid[1]=0;
			fread(&gzid, 2, 1, lt->handle);
			fseeko(lt->handle, b->filepos, SEEK_SET);

			if((striped_kill = (gzid[0]!=0x1f)||(gzid[1]!=0x8b)))
				{
				lxtint32_t clen, unclen, iter=0;
				char *pnt;
				off_t fspos = b->filepos;
				int rc;

				char *zbuff=NULL;
				int zlen = 0;
				struct z_stream_s strm;

				real_uncompressed_siz = b->uncompressed_siz;
				pnt = b->mem = malloc(b->uncompressed_siz);
				b->uncompressed_siz = 0;

				lxt2_rd_regenerate_process_mask(lt);

				while(iter!=0xFFFFFFFF)
					{
					clen = unclen = iter = 0;				
					fread(&clen, 4, 1, lt->handle);		clen = lxt2_rd_get_32(&clen,0);
					fread(&unclen, 4, 1, lt->handle);	unclen = lxt2_rd_get_32(&unclen,0);
					fread(&iter, 4, 1, lt->handle);		iter = lxt2_rd_get_32(&iter,0);

					fspos += 12;
					if((iter==0xFFFFFFFF)||(lt->process_mask_compressed[iter/LXT2_RD_PARTIAL_SIZE]))
						{
						if(clen > zlen)
							{
							if(zbuff) free(zbuff);
							zbuff = malloc(zlen = clen * 2);
							}

						fread(zbuff, clen, 1, lt->handle);

						strm.avail_in = clen-10;
						strm.avail_out = unclen;
						strm.total_in = strm.total_out = 0;
						strm.zalloc = NULL; strm.zfree = NULL; strm.opaque = NULL;
						strm.next_in = zbuff+10;
						strm.next_out = pnt;

						rc = inflateInit2(&strm, -MAX_WBITS);
						while (Z_OK == (rc = inflate(&strm, Z_NO_FLUSH)));
						rc = inflateEnd(&strm);
						if(strm.total_out!=unclen)
							{
							fprintf(stderr, LXT2_RDLOAD"short read on subblock %ld vs %d (exp), ignoring\n", strm.total_out, unclen);
							free(b->mem); b->mem=NULL;
							b->short_read_ignore = 1;
							b->uncompressed_siz = real_uncompressed_siz;
							break;
							}

						b->uncompressed_siz+=strm.total_out;
						pnt += strm.total_out;
						fspos += clen;
						}
						else
						{
						fspos += clen;
						fseeko(lt->handle, fspos, SEEK_SET);
						}
					}


				if(zbuff) free(zbuff);
				}
				else
				{
				b->mem = malloc(b->uncompressed_siz);
				lt->zhandle = gzdopen(dup(fileno(lt->handle)), "rb");
				rc=gzread(lt->zhandle, b->mem, b->uncompressed_siz);
				gzclose(lt->zhandle); lt->zhandle=NULL;
				if(rc!=b->uncompressed_siz)
					{
					fprintf(stderr, LXT2_RDLOAD"short read on block %d vs %d (exp), ignoring\n", rc, b->uncompressed_siz);
					free(b->mem); b->mem=NULL;
					b->short_read_ignore = 1;
					}
					else
					{
					lt->block_mem_consumed += b->uncompressed_siz;
					}
				}

			bfinal=b;
			blkfinal = blk;
			}

		if(b->mem)
			{
			lxt2_rd_process_block(lt, b);

			if(striped_kill)
				{
				free(b->mem); b->mem=NULL;
				b->uncompressed_siz = real_uncompressed_siz;
				}
			else
			if(lt->numblocks > 1)	/* no sense freeing up the single block case */
				{
				if(lt->block_mem_consumed > lt->block_mem_max)
					{
					lt->block_mem_consumed -= b->uncompressed_siz;
					free(b->mem); b->mem=NULL;
					}
				}
			}

		blk++;
		b=b->next;
		}
	}

if((bcutoff)&&(bfinal!=bcutoff))
	{
	fprintf(stderr, LXT2_RDLOAD"block [%d] processed "LXT2_RD_LLD" / "LXT2_RD_LLD"\n", blkfinal, bfinal->start, bfinal->end);
	}

return(blk);
}


/*
 * callback access to the user callback data pointer (if required)
 */ 
_LXT2_RD_INLINE void *lxt2_rd_get_user_callback_data_pointer(struct lxt2_rd_trace *lt)
{
if(lt)
	{
	return(lt->user_callback_data_pointer);
	}
	else
	{
	return(NULL);
	}
}


/*
 * limit access to certain timerange in file
 * and return number of active blocks
 */
unsigned int lxt2_rd_limit_time_range(struct lxt2_rd_trace *lt, lxtint64_t strt_time, lxtint64_t end_time)
{
lxtint64_t tmp_time;
int blk=0;

if(lt)
	{
	struct lxt2_rd_block *b = lt->block_head;
	struct lxt2_rd_block *bprev = NULL;
	int state = 0;

	if(strt_time > end_time)
		{
		tmp_time = strt_time;
		strt_time = end_time;
		end_time = tmp_time;
		}

	while(b)
		{
		switch(state)
			{
			case 0: if(b->end >= strt_time) 
					{
					state = 1;
					if((b->start > strt_time) && (bprev))
						{
						bprev->exclude_block = 0;	
						blk++;
						}
					}
				break;

			case 1: if(b->start > end_time) state = 2;
				break;

			default: break;
			}

		if((state==1) && (!b->short_read_ignore))
			{
			b->exclude_block = 0;
			blk++;
			}
			else
			{
			b->exclude_block = 1;
			}

		bprev = b;
		b = b->next;
		}

	}

return(blk);
}

/*
 * unrestrict access to the whole file
 * and return number of active blocks
 */
unsigned int lxt2_rd_unlimit_time_range(struct lxt2_rd_trace *lt)
{
int blk=0;

if(lt)
	{
	struct lxt2_rd_block *b = lt->block_head;

	while(b)
		{
		b->exclude_block = 0;

		if(!b->short_read_ignore)
			{
			blk++;
			}

		b=b->next;
		}
	}

return(blk);
}


