44 BTREE_chase(DC,DC->
left[node]);
45 BTREE_chase(DC,DC->
right[node]);
51static int BTREE_decompress(
unsigned char *packbuf,
unsigned char *unpackbuf)
89 DC.right[node] = *s++;
90 DC.cluetbl[node] = (
signed char)-1;
99 *DC.d++ = (
unsigned char) node;
104 BTREE_chase(&DC,DC.left[node]);
105 BTREE_chase(&DC,DC.right[node]);
111 *DC.d++ = (char) node;
131 if (ggetm(compresseddata,2)==0x46fb
132 || ggetm(compresseddata,2)==0x47fb)
147 if (ggetm(compresseddata,2)==0x46fb)
149 len = ggetm((
char *)compresseddata+2,3);
153 len = ggetm((
char *)compresseddata+2+3,3);
161 return(BTREE_decompress((
unsigned char *)compresseddata,(
unsigned char *)dest));
int GCALL BTREE_decode(void *dest, const void *compresseddata, int *compressedsize)
int GCALL BTREE_size(const void *compresseddata)
bool GCALL BTREE_is(const void *compresseddata)