View | Details | Raw Unified
Collapse All | Expand All

(-) gzip-1.3.5.orig/gzip.h (+2 lines)
 Lines 198-203    Link Here  
extern int to_stdout;      /* output to stdout (-c) */
extern int to_stdout;      /* output to stdout (-c) */
extern int save_orig_name; /* set if original name must be saved */
extern int save_orig_name; /* set if original name must be saved */

            

              
              
#define MIN(a,b) ((a) <= (b) ? (a) : (b))

            

            

              
              

            

        
#define get_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))
#define get_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf(0))

        
#define try_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))
#define try_byte()  (inptr < insize ? inbuf[inptr++] : fill_inbuf(1))

        



(-) gzip-1.3.5.orig/inflate.c
      (-1 / +1 lines)




  

    

    

       Lines 337-343
       
    
  Link Here 
    

  

        
  {
  {

        
    *t = (struct huft *)NULL;
    *t = (struct huft *)NULL;

        
    *m = 0;
    *m = 0;

            

              
    return 0;

              
    return 2;

            

        
  }
  }

        

        



(-) gzip-1.3.5.orig/unlzh.c
      (-16 / +20 lines)




  

    

    

       Lines 149-161
       
    
  Link Here 
    

  

        
    unsigned i, k, len, ch, jutbits, avail, nextcode, mask;
    unsigned i, k, len, ch, jutbits, avail, nextcode, mask;

        

        
    for (i = 1; i <= 16; i++) count[i] = 0;
    for (i = 1; i <= 16; i++) count[i] = 0;

            

              
    for (i = 0; i < (unsigned)nchar; i++) count[bitlen[i]]++;

              
    for (i = 0; i < (unsigned)nchar; i++) {

            

            

              

              
        if (bitlen[i] > 16)

            

            

              

              
        error("Bad table (case a)\n");

            

            

              

              
        else count[bitlen[i]]++;

            

            

              

              
    }

            

        

        
    start[1] = 0;
    start[1] = 0;

        
    for (i = 1; i <= 16; i++)
    for (i = 1; i <= 16; i++)

        
	start[i + 1] = start[i] + (count[i] << (16 - i));
	start[i + 1] = start[i] + (count[i] << (16 - i));

            

              
    if ((start[17] & 0xffff) != 0)

              
    if ((start[17] & 0xffff) != 0 || tablebits > 16) /* 16 for weight below */

            

            

              
	error("Bad table\n");

              
	error("Bad table (case b)\n");

            

        

        
    jutbits = 16 - tablebits;
    jutbits = 16 - tablebits;

        
    for (i = 1; i <= (unsigned)tablebits; i++) {
    for (i = 1; i <= (unsigned)tablebits; i++) {

  

    

    

       Lines 169-183
       
    
  Link Here 
    

  

        

        
    i = start[tablebits + 1] >> jutbits;
    i = start[tablebits + 1] >> jutbits;

        
    if (i != 0) {
    if (i != 0) {

            

              
	k = 1 << tablebits;

              
	k = MIN(1 << tablebits, DIST_BUFSIZE);

            

            

              
	while (i != k) table[i++] = 0;

              
	while (i < k) table[i++] = 0;

            

        
    }
    }

        

        
    avail = nchar;
    avail = nchar;

        
    mask = (unsigned) 1 << (15 - tablebits);
    mask = (unsigned) 1 << (15 - tablebits);

        
    for (ch = 0; ch < (unsigned)nchar; ch++) {
    for (ch = 0; ch < (unsigned)nchar; ch++) {

        
	if ((len = bitlen[ch]) == 0) continue;
	if ((len = bitlen[ch]) == 0) continue;

            

              
	nextcode = start[len] + weight[len];

              
	nextcode = MIN(start[len] + weight[len], DIST_BUFSIZE);

            

        
	if (len <= (unsigned)tablebits) {
	if (len <= (unsigned)tablebits) {

        
	    for (i = start[len]; i < nextcode; i++) table[i] = ch;
	    for (i = start[len]; i < nextcode; i++) table[i] = ch;

        
	} else {
	} else {

  

    

    

       Lines 218-224
       
    
  Link Here 
    

  

        
	for (i = 0; i < 256; i++) pt_table[i] = c;
	for (i = 0; i < 256; i++) pt_table[i] = c;

        
    } else {
    } else {

        
	i = 0;
	i = 0;

            

              
	while (i < n) {

              
	while (i < MIN(n,NPT)) {

            

        
	    c = bitbuf >> (BITBUFSIZ - 3);
	    c = bitbuf >> (BITBUFSIZ - 3);

        
	    if (c == 7) {
	    if (c == 7) {

        
		mask = (unsigned) 1 << (BITBUFSIZ - 1 - 3);
		mask = (unsigned) 1 << (BITBUFSIZ - 1 - 3);

  

    

    

       Lines 228-234
       
    
  Link Here 
    

  

        
	    pt_len[i++] = c;
	    pt_len[i++] = c;

        
	    if (i == i_special) {
	    if (i == i_special) {

        
		c = getbits(2);
		c = getbits(2);

            

              
		while (--c >= 0) pt_len[i++] = 0;

              
		while (--c >= 0 && i < NPT) pt_len[i++] = 0;

            

        
	    }
	    }

        
	}
	}

        
	while (i < nn) pt_len[i++] = 0;
	while (i < nn) pt_len[i++] = 0;

  

    

    

       Lines 248-254
       
    
  Link Here 
    

  

        
	for (i = 0; i < 4096; i++) c_table[i] = c;
	for (i = 0; i < 4096; i++) c_table[i] = c;

        
    } else {
    } else {

        
	i = 0;
	i = 0;

            

              
	while (i < n) {

              
	while (i < MIN(n,NC)) {

            

        
	    c = pt_table[bitbuf >> (BITBUFSIZ - 8)];
	    c = pt_table[bitbuf >> (BITBUFSIZ - 8)];

        
	    if (c >= NT) {
	    if (c >= NT) {

        
		mask = (unsigned) 1 << (BITBUFSIZ - 1 - 8);
		mask = (unsigned) 1 << (BITBUFSIZ - 1 - 8);

  

    

    

       Lines 256-269
       
    
  Link Here 
    

  

        
		    if (bitbuf & mask) c = right[c];
		    if (bitbuf & mask) c = right[c];

        
		    else               c = left [c];
		    else               c = left [c];

        
		    mask >>= 1;
		    mask >>= 1;

            

              
		} while (c >= NT);

              
		} while (c >= NT && (mask || c != left[c]));

            

        
	    }
	    }

        
	    fillbuf((int) pt_len[c]);
	    fillbuf((int) pt_len[c]);

        
	    if (c <= 2) {
	    if (c <= 2) {

        
		if      (c == 0) c = 1;
		if      (c == 0) c = 1;

        
		else if (c == 1) c = getbits(4) + 3;
		else if (c == 1) c = getbits(4) + 3;

        
		else             c = getbits(CBIT) + 20;
		else             c = getbits(CBIT) + 20;

            

              
		while (--c >= 0) c_len[i++] = 0;

              
		while (--c >= 0 && i < NC) c_len[i++] = 0;

            

        
	    } else c_len[i++] = c - 2;
	    } else c_len[i++] = c - 2;

        
	}
	}

        
	while (i < NC) c_len[i++] = 0;
	while (i < NC) c_len[i++] = 0;

  

    

    

       Lines 292-298
       
    
  Link Here 
    

  

        
	    if (bitbuf & mask) j = right[j];
	    if (bitbuf & mask) j = right[j];

        
	    else               j = left [j];
	    else               j = left [j];

        
	    mask >>= 1;
	    mask >>= 1;

            

              
	} while (j >= NC);

              
	} while (j >= NC && (mask || j != left[j]));

            

        
    }
    }

        
    fillbuf((int) c_len[j]);
    fillbuf((int) c_len[j]);

        
    return j;
    return j;

  

    

    

       Lines 309-315
       
    
  Link Here 
    

  

        
	    if (bitbuf & mask) j = right[j];
	    if (bitbuf & mask) j = right[j];

        
	    else               j = left [j];
	    else               j = left [j];

        
	    mask >>= 1;
	    mask >>= 1;

            

              
	} while (j >= NP);

              
	} while (j >= NP && (mask || j != left[j]));

            

        
    }
    }

        
    fillbuf((int) pt_len[j]);
    fillbuf((int) pt_len[j]);

        
    if (j != 0) j = ((unsigned) 1 << (j - 1)) + getbits((int) (j - 1));
    if (j != 0) j = ((unsigned) 1 << (j - 1)) + getbits((int) (j - 1));

  

    

    

       Lines 356-362
       
    
  Link Here 
    

  

        
    while (--j >= 0) {
    while (--j >= 0) {

        
	buffer[r] = buffer[i];
	buffer[r] = buffer[i];

        
	i = (i + 1) & (DICSIZ - 1);
	i = (i + 1) & (DICSIZ - 1);

            

              
	if (++r == count) return r;

              
	if (++r >= count) return r;

            

        
    }
    }

        
    for ( ; ; ) {
    for ( ; ; ) {

        
	c = decode_c();
	c = decode_c();

  

    

    

       Lines 366-379
       
    
  Link Here 
    

  

        
	}
	}

        
	if (c <= UCHAR_MAX) {
	if (c <= UCHAR_MAX) {

        
	    buffer[r] = c;
	    buffer[r] = c;

            

              
	    if (++r == count) return r;

              
	    if (++r >= count) return r;

            

        
	} else {
	} else {

        
	    j = c - (UCHAR_MAX + 1 - THRESHOLD);
	    j = c - (UCHAR_MAX + 1 - THRESHOLD);

        
	    i = (r - decode_p() - 1) & (DICSIZ - 1);
	    i = (r - decode_p() - 1) & (DICSIZ - 1);

        
	    while (--j >= 0) {
	    while (--j >= 0) {

        
		buffer[r] = buffer[i];
		buffer[r] = buffer[i];

        
		i = (i + 1) & (DICSIZ - 1);
		i = (i + 1) & (DICSIZ - 1);

            

              
		if (++r == count) return r;

              
		if (++r >= count) return r;

            

        
	    }
	    }

        
	}
	}

        
    }
    }



(-) gzip-1.3.5.orig/unpack.c
      (-3 / +2 lines)




  

    

    

       Lines 13-19
       
    
  Link Here 
    

  

        
#include "gzip.h"
#include "gzip.h"

        
#include "crypt.h"
#include "crypt.h"

        

            

              
#define MIN(a,b) ((a) <= (b) ? (a) : (b))

              
            

        
/* The arguments must not have side effects. */
/* The arguments must not have side effects. */

        

        
#define MAX_BITLEN 25
#define MAX_BITLEN 25

  

    

    

       Lines 133-139
       
    
  Link Here 
    

  

        
	/* Remember where the literals of this length start in literal[] : */
	/* Remember where the literals of this length start in literal[] : */

        
	lit_base[len] = base;
	lit_base[len] = base;

        
	/* And read the literals: */
	/* And read the literals: */

            

              
	for (n = leaves[len]; n > 0; n--) {

              
	for (n = leaves[len]; n > 0 && base < LITERALS; n--) {

            

        
	    literal[base++] = (uch)get_byte();
	    literal[base++] = (uch)get_byte();

        
	}
	}

        
    }
    }

  

    

    

       Lines 169-175
       
    
  Link Here 
    

  

        
    prefixp = &prefix_len[1<<peek_bits];
    prefixp = &prefix_len[1<<peek_bits];

        
    for (len = 1; len <= peek_bits; len++) {
    for (len = 1; len <= peek_bits; len++) {

        
	int prefixes = leaves[len] << (peek_bits-len); /* may be 0 */
	int prefixes = leaves[len] << (peek_bits-len); /* may be 0 */

            

              
	while (prefixes--) *--prefixp = (uch)len;

              
	while (prefixes-- && prefixp > prefix_len) *--prefixp = (uch)len;

            

        
    }
    }

        
    /* The length of all other codes is unknown: */
    /* The length of all other codes is unknown: */

        
    while (prefixp > prefix_len) *--prefixp = 0;
    while (prefixp > prefix_len) *--prefixp = 0;