108 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			C++
		
	
	
		
			Executable File
		
	
	
	
	
			
		
		
	
	
			108 lines
		
	
	
		
			2.4 KiB
		
	
	
	
		
			C++
		
	
	
		
			Executable File
		
	
	
	
	
//
 | 
						|
// INFUTIL.CPP
 | 
						|
//
 | 
						|
//  Source file for ArchiveLib 2.0
 | 
						|
//
 | 
						|
//  No Copyright claimed by Greenleaf Software!
 | 
						|
//
 | 
						|
// DESCRIPTION
 | 
						|
//
 | 
						|
//  This is one of the ZLIB source files, with as few changes as possible.
 | 
						|
//
 | 
						|
// REVISION HISTORY
 | 
						|
//
 | 
						|
//   February 14, 1996  2.0A : New release
 | 
						|
 | 
						|
#include "arclib.h"
 | 
						|
#if !defined( AL_IBM )
 | 
						|
#pragma hdrstop
 | 
						|
#endif
 | 
						|
#if defined( AL_BORLAND )
 | 
						|
#pragma option -w-
 | 
						|
#endif
 | 
						|
 | 
						|
/* inflate_util.c -- data and routines common to blocks and codes
 | 
						|
 * Copyright (C) 1995 Mark Adler
 | 
						|
 * For conditions of distribution and use, see copyright notice in zlib.h 
 | 
						|
 */
 | 
						|
 | 
						|
#include "zutil.h"
 | 
						|
#include "inftrees.h"
 | 
						|
#include "infutil.h"
 | 
						|
 | 
						|
struct inflate_codes_state {int dummy;}; /* for buggy compilers */
 | 
						|
 | 
						|
/* And'ing with mask[n] masks the lower n bits */
 | 
						|
uInt inflate_mask[ 17 ] = {
 | 
						|
    0x0000,
 | 
						|
    0x0001, 0x0003, 0x0007, 0x000f, 0x001f, 0x003f, 0x007f, 0x00ff,
 | 
						|
    0x01ff, 0x03ff, 0x07ff, 0x0fff, 0x1fff, 0x3fff, 0x7fff, 0xffff
 | 
						|
};
 | 
						|
 | 
						|
 | 
						|
/* copy as much as possible from the sliding window to the output area */
 | 
						|
int inflate_flush(
 | 
						|
struct inflate_blocks_state ZL_FAR *s,
 | 
						|
z_stream *z,
 | 
						|
int r )
 | 
						|
{
 | 
						|
  uInt n;
 | 
						|
  Byte ZL_FAR *p, ZL_FAR *q;
 | 
						|
 | 
						|
  /* local copies of source and destination pointers */
 | 
						|
  p = z->next_out;
 | 
						|
  q = s->read;
 | 
						|
 | 
						|
  /* compute number of bytes to copy as far as end of window */
 | 
						|
  n = (uInt)((q <= s->write ? s->write : s->end) - q);
 | 
						|
  if (n > z->avail_out) n = z->avail_out;
 | 
						|
  if (n && r == Z_BUF_ERROR) r = Z_OK;
 | 
						|
 | 
						|
  /* update counters */
 | 
						|
  z->avail_out -= n;
 | 
						|
  z->total_out += n;
 | 
						|
 | 
						|
  /* update check information */
 | 
						|
  if (s->checkfn != Z_NULL)
 | 
						|
    s->check = (*s->checkfn)(s->check, q, n);
 | 
						|
 | 
						|
  /* copy as far as end of window */
 | 
						|
  zmemcpy(p, q, n);
 | 
						|
  p += n;
 | 
						|
  q += n;
 | 
						|
 | 
						|
  /* see if more to copy at beginning of window */
 | 
						|
  if (q == s->end)
 | 
						|
  {
 | 
						|
    /* wrap pointers */
 | 
						|
    q = s->window;
 | 
						|
    if (s->write == s->end)
 | 
						|
      s->write = s->window;
 | 
						|
 | 
						|
    /* compute bytes to copy */
 | 
						|
    n = (uInt)(s->write - q);
 | 
						|
    if (n > z->avail_out) n = z->avail_out;
 | 
						|
    if (n && r == Z_BUF_ERROR) r = Z_OK;
 | 
						|
 | 
						|
    /* update counters */
 | 
						|
    z->avail_out -= n;
 | 
						|
    z->total_out += n;
 | 
						|
 | 
						|
    /* update check information */
 | 
						|
    if (s->checkfn != Z_NULL)
 | 
						|
      s->check = (*s->checkfn)(s->check, q, n);
 | 
						|
 | 
						|
    /* copy */
 | 
						|
    zmemcpy(p, q, n);
 | 
						|
    p += n;
 | 
						|
    q += n;
 | 
						|
  }
 | 
						|
 | 
						|
  /* update pointers */
 | 
						|
  z->next_out = p;
 | 
						|
  s->read = q;
 | 
						|
 | 
						|
  /* done */
 | 
						|
  return r;
 | 
						|
}
 |