The Design and Implementation of the FreeBSD Operating System, Second Edition
Now available: The Design and Implementation of the FreeBSD Operating System (Second Edition)


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]

FreeBSD/Linux Kernel Cross Reference
sys/opencrypto/deflate.c

Version: -  FREEBSD  -  FREEBSD-13-STABLE  -  FREEBSD-13-0  -  FREEBSD-12-STABLE  -  FREEBSD-12-0  -  FREEBSD-11-STABLE  -  FREEBSD-11-0  -  FREEBSD-10-STABLE  -  FREEBSD-10-0  -  FREEBSD-9-STABLE  -  FREEBSD-9-0  -  FREEBSD-8-STABLE  -  FREEBSD-8-0  -  FREEBSD-7-STABLE  -  FREEBSD-7-0  -  FREEBSD-6-STABLE  -  FREEBSD-6-0  -  FREEBSD-5-STABLE  -  FREEBSD-5-0  -  FREEBSD-4-STABLE  -  FREEBSD-3-STABLE  -  FREEBSD22  -  l41  -  OPENBSD  -  linux-2.6  -  MK84  -  PLAN9  -  xnu-8792 
SearchContext: -  none  -  3  -  10 

    1 /*      $FreeBSD: src/sys/opencrypto/deflate.c,v 1.5 2008/10/23 15:53:51 des Exp $      */
    2 /* $OpenBSD: deflate.c,v 1.3 2001/08/20 02:45:22 hugh Exp $ */
    3 
    4 /*-
    5  * Copyright (c) 2001 Jean-Jacques Bernard-Gundol (jj@wabbitt.org)
    6  *
    7  * Redistribution and use in source and binary forms, with or without
    8  * modification, are permitted provided that the following conditions
    9  * are met:
   10  *
   11  * 1. Redistributions of source code must retain the above copyright
   12  *   notice, this list of conditions and the following disclaimer.
   13  * 2. Redistributions in binary form must reproduce the above copyright
   14  *   notice, this list of conditions and the following disclaimer in the
   15  *   documentation and/or other materials provided with the distribution.
   16  * 3. The name of the author may not be used to endorse or promote products
   17  *   derived from this software without specific prior written permission.
   18  *
   19  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
   20  * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
   21  * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
   22  * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
   23  * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
   24  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
   25  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
   26  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
   27  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
   28  * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
   29  */
   30 
   31 /*
   32  * This file contains a wrapper around the deflate algo compression
   33  * functions using the zlib library (see net/zlib.{c,h})
   34  */
   35 
   36 #include <sys/types.h>
   37 #include <sys/param.h>
   38 #include <sys/malloc.h>
   39 #include <sys/param.h>
   40 #include <sys/systm.h>
   41 #include <net/zlib.h>
   42 
   43 #include <opencrypto/cryptodev.h>
   44 #include <opencrypto/deflate.h>
   45 
   46 int window_inflate = -1 * MAX_WBITS;
   47 int window_deflate = -12;
   48 
   49 /*
   50  * This function takes a block of data and (de)compress it using the deflate
   51  * algorithm
   52  */
   53 
   54 u_int32_t
   55 deflate_global(u_int8_t *data, u_int32_t size, int decomp, u_int8_t **out)
   56 {
   57         /* decomp indicates whether we compress (0) or decompress (1) */
   58 
   59         z_stream zbuf;
   60         u_int8_t *output;
   61         u_int32_t count, result;
   62         int error, i = 0, j;
   63         struct deflate_buf buf[ZBUF];
   64 
   65         bzero(&zbuf, sizeof(z_stream));
   66         for (j = 0; j < ZBUF; j++)
   67                 buf[j].flag = 0;
   68 
   69         zbuf.next_in = data;    /* data that is going to be processed */
   70         zbuf.zalloc = z_alloc;
   71         zbuf.zfree = z_free;
   72         zbuf.opaque = Z_NULL;
   73         zbuf.avail_in = size;   /* Total length of data to be processed */
   74 
   75         if (!decomp) {
   76                 buf[i].out = kmalloc((u_long) size, M_CRYPTO_DATA, M_WAITOK);
   77                 buf[i].size = size;
   78                 buf[i].flag = 1;
   79                 i++;
   80         } else {
   81                 /*
   82                  * Choose a buffer with 4x the size of the input buffer
   83                  * for the size of the output buffer in the case of
   84                  * decompression. If it's not sufficient, it will need to be
   85                  * updated while the decompression is going on
   86                  */
   87 
   88                 buf[i].out = kmalloc((u_long) (size * 4),
   89                                      M_CRYPTO_DATA, M_WAITOK);
   90                 buf[i].size = size * 4;
   91                 buf[i].flag = 1;
   92                 i++;
   93         }
   94 
   95         zbuf.next_out = buf[0].out;
   96         zbuf.avail_out = buf[0].size;
   97 
   98         error = decomp ? inflateInit2(&zbuf, window_inflate) :
   99             deflateInit2(&zbuf, Z_DEFAULT_COMPRESSION, Z_METHOD,
  100                     window_deflate, Z_MEMLEVEL, Z_DEFAULT_STRATEGY);
  101 
  102         if (error != Z_OK)
  103                 goto bad;
  104         for (;;) {
  105                 error = decomp ? inflate(&zbuf, Z_PARTIAL_FLUSH) :
  106                                  deflate(&zbuf, Z_PARTIAL_FLUSH);
  107                 if (error != Z_OK && error != Z_STREAM_END)
  108                         goto bad;
  109                 else if (zbuf.avail_in == 0 && zbuf.avail_out != 0)
  110                         goto end;
  111                 else if (zbuf.avail_out == 0 && i < (ZBUF - 1)) {
  112                         /* we need more output space, allocate size */
  113                         buf[i].out = kmalloc((u_long) size,
  114                                              M_CRYPTO_DATA, M_WAITOK);
  115                         zbuf.next_out = buf[i].out;
  116                         buf[i].size = size;
  117                         buf[i].flag = 1;
  118                         zbuf.avail_out = buf[i].size;
  119                         i++;
  120                 } else
  121                         goto bad;
  122         }
  123 
  124 end:
  125         result = count = zbuf.total_out;
  126 
  127         *out = kmalloc((u_long) result, M_CRYPTO_DATA, M_WAITOK);
  128         if (decomp)
  129                 inflateEnd(&zbuf);
  130         else
  131                 deflateEnd(&zbuf);
  132         output = *out;
  133         for (j = 0; buf[j].flag != 0; j++) {
  134                 if (count > buf[j].size) {
  135                         bcopy(buf[j].out, *out, buf[j].size);
  136                         *out += buf[j].size;
  137                         kfree(buf[j].out, M_CRYPTO_DATA);
  138                         count -= buf[j].size;
  139                 } else {
  140                         /* it should be the last buffer */
  141                         bcopy(buf[j].out, *out, count);
  142                         *out += count;
  143                         kfree(buf[j].out, M_CRYPTO_DATA);
  144                         count = 0;
  145                 }
  146         }
  147         *out = output;
  148         return result;
  149 
  150 bad:
  151         *out = NULL;
  152         for (j = 0; buf[j].flag != 0; j++)
  153                 kfree(buf[j].out, M_CRYPTO_DATA);
  154         if (decomp)
  155                 inflateEnd(&zbuf);
  156         else
  157                 deflateEnd(&zbuf);
  158         return 0;
  159 }
  160 
  161 void *
  162 z_alloc(void *nil, u_int type, u_int size)
  163 {
  164         void *ptr;
  165 
  166         ptr = kmalloc(type *size, M_CRYPTO_DATA, M_WAITOK);
  167         return ptr;
  168 }
  169 
  170 void
  171 z_free(void *nil, void *ptr)
  172 {
  173         kfree(ptr, M_CRYPTO_DATA);
  174 }

Cache object: 258bcfe618c52bef15b1d12d678872d0


[ source navigation ] [ diff markup ] [ identifier search ] [ freetext search ] [ file search ] [ list types ] [ track identifier ]


This page is part of the FreeBSD/Linux Linux Kernel Cross-Reference, and was automatically generated using a modified version of the LXR engine.