static void
output(int code)
{
cur_accum &= masks[cur_bits];
if (cur_bits > 0)
cur_accum |= ((long)code << cur_bits);
else
cur_accum = code;
cur_bits += n_bits;
while( cur_bits >= 8 ) {
char_out( (int)((unsigned int) cur_accum & 0xff) );
cur_accum >>= 8;
cur_bits -= 8;
}
/*
* If the next entry is going to be too big for the code size, then
* increase it, if possible.
*/
if (free_ent > maxcode || clear_flg) {
if (clear_flg) {
maxcode = MAXCODE (n_bits = g_init_bits);
clear_flg = 0;
} else {
n_bits++;
if ( n_bits == maxbits )
maxcode = maxmaxcode;
else
maxcode = MAXCODE(n_bits);
}
}
if (code == EOFCode) {
/* At EOF, write the rest of the buffer */
while( cur_bits > 0 ) {
char_out( (int)((unsigned int)cur_accum & 0xff) );
cur_accum >>= 8;
cur_bits -= 8;
}
flush_char();
fflush( g_outfile );
#ifdef FOO
if(ferror( g_outfile))
FatalError("unable to write GIF file");
#endif
}
}
/* Output a character. */
static void out_char (int c)
{
if (out.mode==buffered) {
if (out.buffindex < MAXHEADERLEN)
out.buffer[out.buffindex++] = c;
else {
/* Buffer full -> turn it off */
outbuffer_off(); char_out(c);
}
} else {
char_out(c);
}
}
static void output(int code, struct aap *a)
{
a->cur_accum &= masks[a->cur_bits];
if (a->cur_bits > 0)
a->cur_accum |= ((long)code << a->cur_bits);
else
a->cur_accum = code;
a->cur_bits += a->n_bits;
while( a->cur_bits >= 8 ) {
char_out( (int) (a->cur_accum & 0xff), a );
a->cur_accum >>= 8;
a->cur_bits -= 8;
}
/*
* If the next entry is going to be too big for the code size,
* then increase it, if possible.
*/
if (a->free_ent > a->maxcode || a->clear_flg) {
if( a->clear_flg ) {
a->maxcode = MAXCODE (a->n_bits = a->g_init_bits);
a->clear_flg = 0;
}
else {
a->n_bits++;
if ( a->n_bits == XV_BITS )
a->maxcode = (1<<XV_BITS);
else
a->maxcode = MAXCODE(a->n_bits);
}
}
if( code == a->EOFCode ) {
/* At EOF, write the rest of the buffer */
while( a->cur_bits > 0 ) {
char_out( (int)(a->cur_accum & 0xff), a );
a->cur_accum >>= 8;
a->cur_bits -= 8;
}
flush_char(a);
fflush( a->g_outfile );
}
}
int main(int argc, char** argv)
{
char temp_char=0;
srand(time(NULL));
int i=0,j=0;
for (i=0;i<char_amount;i++)//Задание 1. Вывод таблицы символов-кодов.
{
printf("%c ",temp_char);
temp_char++;
}
printf("\n-----------------------\n");
//Задание 3. Сортировка строк.
char **mas_string;
// Создаем двумерный массив char'ов- массив строк.
mas_string=(char**)malloc(string_amount*sizeof(char));// Выделяем под это память.
for(i=0;i<string_amount;i++)
mas_string[i]=(char*)malloc(char_amount*sizeof(char));
//Заполняем его случайными значениями.
for (i=0;i<string_amount;i++)
for (j=0;j<char_amount;j++)
{
mas_string[i][j]=20+rand()%(char_amount-20);
}
for (i=0;i<string_amount;i++)// Выводим эти значения.
{
printf("\n-------String#%d-----------\n",i);
char_out(mas_string[i],char_amount);
}
// Вызываем ф-цию сортировки.
string_sort(mas_string);
//Выводим отсортированные строки
for (i=0;i<string_amount;i++)
{
printf("\n-------Sorted string#%d-----------\n",i);
char_out(mas_string[i],char_amount);
}
// Освобождаем память, выделенную под двумерный массив.
for(i=0;i<string_amount;i++)
free(mas_string[i]);
free(mas_string);
return 0;
}
static void print_char(uint8_t c)
{
if (c == 0x25)
c = '\n';
else if (c == 0x5F)
c = ' ';
char_out(c);
}
void printg(char * text)
{
int i;
for(i = 0; i < strlen(text); i++) {
char_out(text[i]);
}
}
/*
* Here to read the shell input file descriptor.
*/
void
do_fdinput(void)
{
char c;
if (read(tfdMaster, &c, 1) == 1)
char_out(c);
}
/* Turn off output buffering, inserting a string at a given place. */
static void outbuffer_off_insert (uintL insertpoint, const char* insert)
{
if (out.mode==buffered) {
uintL index = 0;
while (1) {
if (index==insertpoint) {
while (!(*insert==0)) {
char_out(*insert++);
}
}
if (index == out.buffindex)
break;
char_out(out.buffer[index]); index++;
}
out.mode = direct;
}
}
/* Turn off output buffering. */
static void outbuffer_off (void)
{
if (out.mode==buffered) {
uintL index = 0;
while (index < out.buffindex) {
char_out(out.buffer[index]); index++;
}
out.mode = direct;
}
}
static void
char_out(GR_CHAR ch)
{
switch(ch) {
case '\r':
case '\n':
xpos = 0;
ypos += height;
if(ypos >= TEXTWIN_HEIGHT - height) {
ypos -= height;
/* FIXME: changing FALSE to TRUE crashes nano-X*/
/* clear screen, no scroll*/
ypos = 0;
GrClearWindow(wt, GR_FALSE);
}
return;
case '\007': /* bel*/
return;
case '\t':
xpos += width;
while((xpos/width) & 7)
char_out(' ');
return;
case '\b': /* assumes fixed width font!!*/
if (xpos <= 0)
return;
char_del(xpos, ypos);
char_out(' ');
char_del(xpos, ypos);
return;
}
GrText(wt, gct, xpos+1, ypos, &ch, 1, GR_TFTOP);
xpos += width;
if (xpos >= TEXTWIN_WIDTH-width)
char_out('\n');
}
int fastcall write(int hnd, const void *buf, unsigned count)
{
static BYTE *b;
static int c;
b = buf;
c = (int)count;
hnd = hnd;
if(!screen_initialized)
return uart_write_buffer(buf, count);
while(c) {
char_out(*b);
b++;
c--;
}
return count;
}
void char_out(GR_CHAR ch)
{
switch(ch) {
case '\r':
xpos = 0;
return;
case '\n':
ypos += height;
if(ypos > si.rows - 60 - height) {
ypos -= height;
#if HAVEBLIT
bogl_cfb8_blit(50, 30, si.cols-120,
si.rows-60-height, 50, 30+height);
GrFillRect(w1, gc3, 50, ypos, si.cols-120, height);
#else
/* FIXME: changing FALSE to TRUE crashes nano-X*/
/* clear screen, no scroll*/
ypos = 0;
GrClearWindow(w1, GR_FALSE);
#endif
}
return;
case '\007': /* bel*/
return;
case '\t':
xpos += width;
while((xpos/width) & 7)
char_out(' ');
return;
case '\b': /* assumes fixed width font!!*/
if (xpos <= 0)
return;
char_del(xpos, ypos);
return;
}
GrText(w1, gc1, xpos+1, ypos, &ch, 1, GR_TFTOP);
xpos += width;
}
static void string_out(const char *p)
{
while(*p)
char_out(*p++);
}
/*
* Here when a keyboard press or injection occurs.
*/
void
do_keystroke(GR_EVENT_KEYSTROKE *kp)
{
if (bTextwin)
char_out(kp->ch);
}
static void
compress(int init_bits, gdIOCtxPtr outfile, gdImagePtr im, GifCtx *ctx)
{
register long fcode;
register code_int i /* = 0 */;
register int c;
register code_int ent;
register code_int disp;
register code_int hsize_reg;
register int hshift;
/*
* Set up the globals: g_init_bits - initial number of bits
* g_outfile - pointer to output file
*/
ctx->g_init_bits = init_bits;
ctx->g_outfile = outfile;
/*
* Set up the necessary values
*/
ctx->offset = 0;
ctx->out_count = 0;
ctx->clear_flg = 0;
ctx->in_count = 1;
ctx->maxcode = MAXCODE(ctx->n_bits = ctx->g_init_bits);
ctx->ClearCode = (1 << (init_bits - 1));
ctx->EOFCode = ctx->ClearCode + 1;
ctx->free_ent = ctx->ClearCode + 2;
char_init(ctx);
ent = GIFNextPixel( im, ctx );
hshift = 0;
for ( fcode = (long) hsize; fcode < 65536L; fcode *= 2L )
++hshift;
hshift = 8 - hshift; /* set hash code range bound */
hsize_reg = hsize;
cl_hash( (count_int) hsize_reg, ctx ); /* clear hash table */
output( (code_int)ctx->ClearCode, ctx );
#ifdef SIGNED_COMPARE_SLOW
while ( (c = GIFNextPixel( im )) != (unsigned) EOF ) {
#else /*SIGNED_COMPARE_SLOW*/
while ( (c = GIFNextPixel( im, ctx )) != EOF ) { /* } */
#endif /*SIGNED_COMPARE_SLOW*/
++(ctx->in_count);
fcode = (long) (((long) c << maxbits) + ent);
i = (((code_int)c << hshift) ^ ent); /* xor hashing */
if ( HashTabOf (i) == fcode ) {
ent = CodeTabOf (i);
continue;
} else if ( (long)HashTabOf (i) < 0 ) /* empty slot */
goto nomatch;
disp = hsize_reg - i; /* secondary hash (after G. Knott) */
if ( i == 0 )
disp = 1;
probe:
if ( (i -= disp) < 0 )
i += hsize_reg;
if ( HashTabOf (i) == fcode ) {
ent = CodeTabOf (i);
continue;
}
if ( (long)HashTabOf (i) > 0 )
goto probe;
nomatch:
output ( (code_int) ent, ctx );
++(ctx->out_count);
ent = c;
#ifdef SIGNED_COMPARE_SLOW
if ( (unsigned) ctx->free_ent < (unsigned) maxmaxcode) {
#else /*SIGNED_COMPARE_SLOW*/
if ( ctx->free_ent < maxmaxcode ) { /* } */
#endif /*SIGNED_COMPARE_SLOW*/
CodeTabOf (i) = ctx->free_ent++; /* code -> hashtable */
HashTabOf (i) = fcode;
} else
cl_block(ctx);
}
/*
* Put out the final code.
*/
output( (code_int)ent, ctx );
++(ctx->out_count);
output( (code_int) ctx->EOFCode, ctx );
}
/*****************************************************************
* TAG( output )
*
* Output the given code.
* Inputs:
* code: A n_bits-bit integer. If == -1, then EOF. This assumes
* that n_bits =< (long)wordsize - 1.
* Outputs:
* Outputs code to the file.
* Assumptions:
* Chars are 8 bits long.
* Algorithm:
* Maintain a GIFBITS character long buffer (so that 8 codes will
* fit in it exactly). Use the VAX insv instruction to insert each
* code in turn. When the buffer fills up empty it and start over.
*/
static const unsigned long masks[] = { 0x0000, 0x0001, 0x0003, 0x0007, 0x000F,
0x001F, 0x003F, 0x007F, 0x00FF,
0x01FF, 0x03FF, 0x07FF, 0x0FFF,
0x1FFF, 0x3FFF, 0x7FFF, 0xFFFF };
/* Arbitrary value to mark output is done. When we see EOFCode, then we don't
* expect to see any more data. If we do (e.g. corrupt image inputs), cur_bits
* might be negative, so flag it to return early.
*/
#define CUR_BITS_FINISHED -1000
static void
output(code_int code, GifCtx *ctx)
{
if (ctx->cur_bits == CUR_BITS_FINISHED) {
return;
}
ctx->cur_accum &= masks[ ctx->cur_bits ];
if( ctx->cur_bits > 0 )
ctx->cur_accum |= ((long)code << ctx->cur_bits);
else
ctx->cur_accum = code;
ctx->cur_bits += ctx->n_bits;
while( ctx->cur_bits >= 8 ) {
char_out( (unsigned int)(ctx->cur_accum & 0xff), ctx );
ctx->cur_accum >>= 8;
ctx->cur_bits -= 8;
}
/*
* If the next entry is going to be too big for the code size,
* then increase it, if possible.
*/
if ( ctx->free_ent > ctx->maxcode || ctx->clear_flg ) {
if( ctx->clear_flg ) {
ctx->maxcode = MAXCODE (ctx->n_bits = ctx->g_init_bits);
ctx->clear_flg = 0;
} else {
++(ctx->n_bits);
if ( ctx->n_bits == maxbits )
ctx->maxcode = maxmaxcode;
else
ctx->maxcode = MAXCODE(ctx->n_bits);
}
}
if( code == ctx->EOFCode ) {
/*
* At EOF, write the rest of the buffer.
*/
while( ctx->cur_bits > 0 ) {
char_out( (unsigned int)(ctx->cur_accum & 0xff), ctx);
ctx->cur_accum >>= 8;
ctx->cur_bits -= 8;
}
/* Flag that it's done to prevent re-entry. */
ctx->cur_bits = CUR_BITS_FINISHED;
flush_char(ctx);
}
}
/*
* Clear out the hash table
*/
static void
cl_block (GifCtx *ctx) /* table clear for block compress */
{
cl_hash ( (count_int) hsize, ctx );
ctx->free_ent = ctx->ClearCode + 2;
ctx->clear_flg = 1;
output( (code_int)ctx->ClearCode, ctx);
}
static void
cl_hash(register count_int chsize, GifCtx *ctx) /* reset code table */
{
register count_int *htab_p = ctx->htab+chsize;
register long i;
register long m1 = -1;
i = chsize - 16;
do { /* might use Sys V memset(3) here */
*(htab_p-16) = m1;
*(htab_p-15) = m1;
*(htab_p-14) = m1;
*(htab_p-13) = m1;
*(htab_p-12) = m1;
*(htab_p-11) = m1;
*(htab_p-10) = m1;
*(htab_p-9) = m1;
*(htab_p-8) = m1;
*(htab_p-7) = m1;
*(htab_p-6) = m1;
*(htab_p-5) = m1;
*(htab_p-4) = m1;
*(htab_p-3) = m1;
*(htab_p-2) = m1;
*(htab_p-1) = m1;
htab_p -= 16;
} while ((i -= 16) >= 0);
for ( i += 16; i > 0; --i )
*--htab_p = m1;
}
/******************************************************************************
*
* GIF Specific routines
*
******************************************************************************/
/*
* Set up the 'byte output' routine
*/
static void
char_init(GifCtx *ctx)
{
ctx->a_count = 0;
}
/*
* Add a character to the end of the current packet, and if it is 254
* characters, flush the packet to disk.
*/
static void
char_out(int c, GifCtx *ctx)
{
ctx->accum[ ctx->a_count++ ] = c;
if( ctx->a_count >= 254 )
flush_char(ctx);
}