qcom/NOTICE.txt

   1 This NOTICE.txt file contains certain notices Qualcomm Technologies, Inc. ("QTI")
   2 is required to provide with certain software components. Notwithstanding anything
   3 in the notices in this file, your use of such software components together with
   4 the QTI software ("Software") is subject to the terms of your separate license
   5 from QTI. Compliance with all copyright laws and software licenses included in
   6 this file are the responsibility of the user. Except as may be granted by
   7 separate express written agreement, this file provides no license to any
   8 patents, trademarks, copyrights, or other intellectual property of QTI or its
   9 affiliates.
  10 Software provided with this notice is NOT A CONTRIBUTION to any open source
  11 project. If alternative licensing is available for any of the components with
  12 licenses or attributions provided below, a license choice is made for receiving
  13 such code by QTI.
  14
  15 Copyright (c) 2013-2017 Qualcomm Technologies, Inc. All rights reserved.
  16
  17 Qualcomm is a trademark of Qualcomm Incorporated, registered in the
  18 United States and other countries. All Qualcomm Incorporated trademarks are used
  19 with permission. Other products and brand names may be trademarks or registered
  20 trademarks of their respective owners.
  21
  22
  23   LICENSE ISSUES
  24   ==============
  25
  26   The OpenSSL toolkit stays under a dual license, i.e. both the conditions of
  27   the OpenSSL License and the original SSLeay license apply to the toolkit.
  28   See below for the actual license texts. Actually both licenses are BSD-style
  29   Open Source licenses. In case of any license issues related to OpenSSL
  30   please contact openssl-core@openssl.org.
  31
  32   OpenSSL License
  33   ---------------
  34
  35 /* ====================================================================
  36  * Copyright (c) 1998-2011 The OpenSSL Project.  All rights reserved.
  37  *
  38  * Redistribution and use in source and binary forms, with or without
  39  * modification, are permitted provided that the following conditions
  40  * are met:
  41  *
  42  * 1. Redistributions of source code must retain the above copyright
  43  *    notice, this list of conditions and the following disclaimer.
  44  *
  45  * 2. Redistributions in binary form must reproduce the above copyright
  46  *    notice, this list of conditions and the following disclaimer in
  47  *    the documentation and/or other materials provided with the
  48  *    distribution.
  49  *
  50  * 3. All advertising materials mentioning features or use of this
  51  *    software must display the following acknowledgment:
  52  *    "This product includes software developed by the OpenSSL Project
  53  *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
  54  *
  55  * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
  56  *    endorse or promote products derived from this software without
  57  *    prior written permission. For written permission, please contact
  58  *    openssl-core@openssl.org.
  59  *
  60  * 5. Products derived from this software may not be called "OpenSSL"
  61  *    nor may "OpenSSL" appear in their names without prior written
  62  *    permission of the OpenSSL Project.
  63  *
  64  * 6. Redistributions of any form whatsoever must retain the following
  65  *    acknowledgment:
  66  *    "This product includes software developed by the OpenSSL Project
  67  *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
  68  *
  69  * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
  70  * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  71  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
  72  * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
  73  * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  74  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  75  * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  76  * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  77  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
  78  * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  79  * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
  80  * OF THE POSSIBILITY OF SUCH DAMAGE.
  81  * ====================================================================
  82  *
  83  * This product includes cryptographic software written by Eric Young
  84  * (eay@cryptsoft.com).  This product includes software written by Tim
  85  * Hudson (tjh@cryptsoft.com).
  86  *
  87  */
  88
  89  Original SSLeay License
  90  -----------------------
  91
  92 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
  93  * All rights reserved.
  94  *
  95  * This package is an SSL implementation written
  96  * by Eric Young (eay@cryptsoft.com).
  97  * The implementation was written so as to conform with Netscapes SSL.
  98  *
  99  * This library is free for commercial and non-commercial use as long as
 100  * the following conditions are aheared to.  The following conditions
 101  * apply to all code found in this distribution, be it the RC4, RSA,
 102  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
 103  * included with this distribution is covered by the same copyright terms
 104  * except that the holder is Tim Hudson (tjh@cryptsoft.com).
 105  *
 106  * Copyright remains Eric Young's, and as such any Copyright notices in
 107  * the code are not to be removed.
 108  * If this package is used in a product, Eric Young should be given attribution
 109  * as the author of the parts of the library used.
 110  * This can be in the form of a textual message at program startup or
 111  * in documentation (online or textual) provided with the package.
 112  *
 113  * Redistribution and use in source and binary forms, with or without
 114  * modification, are permitted provided that the following conditions
 115  * are met:
 116  * 1. Redistributions of source code must retain the copyright
 117  *    notice, this list of conditions and the following disclaimer.
 118  * 2. Redistributions in binary form must reproduce the above copyright
 119  *    notice, this list of conditions and the following disclaimer in the
 120  *    documentation and/or other materials provided with the distribution.
 121  * 3. All advertising materials mentioning features or use of this software
 122  *    must display the following acknowledgement:
 123  *    "This product includes cryptographic software written by
 124  *     Eric Young (eay@cryptsoft.com)"
 125  *    The word 'cryptographic' can be left out if the rouines from the library
 126  *    being used are not cryptographic related :-).
 127  * 4. If you include any Windows specific code (or a derivative thereof) from
 128  *    the apps directory (application code) you must include an acknowledgement:
 129  *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
 130  *
 131  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
 132  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 133  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 134  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
 135  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 136  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 137  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 138  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 139  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 140  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 141  * SUCH DAMAGE.
 142  *
 143  * The licence and distribution terms for any publically available version or
 144  * derivative of this code cannot be changed.  i.e. this code cannot simply be
 145  * copied and put under another distribution licence
 146  * [including the GNU Public Licence.]
 147  */
 148
 149
 150 ------------------------------------------------------------------------------
 151 ------------------------------------------------------------------------------
 152
 153 /* ====================================================================
 154  * Copyright (C) 1995-2005 Jean-loup Gailly
 155  * Copyright (C) 1995-2009 Mark Adler
 156  * Copyright (C) 1995-2003, 2010 Mark Adler
 157  * For conditions of distribution and use, see copyright notice in zlib.h
 158  */
 159
 160
 161  /* zlib.h -- interface of the 'zlib' general purpose compression library
 162   version 1.2.3, July 18th, 2005
 163
 164   Copyright (C) 1995-2005 Jean-loup Gailly and Mark Adler
 165
 166   This software is provided 'as-is', without any express or implied
 167   warranty.  In no event will the authors be held liable for any damages
 168   arising from the use of this software.
 169
 170   Permission is granted to anyone to use this software for any purpose,
 171   including commercial applications, and to alter it and redistribute it
 172   freely, subject to the following restrictions:
 173
 174   1. The origin of this software must not be misrepresented; you must not
 175      claim that you wrote the original software. If you use this software
 176      in a product, an acknowledgment in the product documentation would be
 177      appreciated but is not required.
 178   2. Altered source versions must be plainly marked as such, and must not be
 179      misrepresented as being the original software.
 180   3. This notice may not be removed or altered from any source distribution.
 181   Jean-loup Gailly        Mark Adler
 182   jloup@gzip.org          madler@alumni.caltech.edu
 183
 184
 185   The data format used by the zlib library is described by RFCs (Request for
 186   Comments) 1950 to 1952 in the files http://www.ietf.org/rfc/rfc1950.txt
 187   (zlib format), rfc1951.txt (deflate format) and rfc1952.txt (gzip format).
 188 */
 189
 190
 191 ------------------------------------------------------------------------------
 192
 193  //
 194 // Copyright (c) 2004-2006 Qualphone, Inc. All rights reserved.
 195 //
 196 //
 197 /*
 198  * This code implements the MD5 message-digest algorithm.
 199  * The algorithm is due to Ron Rivest.  This code was
 200  * written by Colin Plumb in 1993, no copyright is claimed.
 201  * This code is in the public domain; do with it what you wish.
 202  *
 203  * Equivalent code is available from RSA Data Security, Inc.
 204  * This code has been tested against that, and is equivalent,
 205  * except that you don't need to include two pages of legalese
 206  * with every copy.
 207  *
 208  * To compute the message digest of a chunk of bytes, declare an
 209  * MD5Context structure, pass it to MD5Init, call MD5Update as
 210  * needed on buffers full of bytes, and then call MD5Final, which
 211  * will fill a supplied 16-byte array with the digest.
 212  */
 213
 214
 215 ------------------------------------------------------------------------------
 216 ------------------------------------------------------------------------------
 217
 218
 219
 220 /*
 221  * Written by Aaron D. Gifford <me@aarongifford.com>
 222  *
 223  * Copyright 2000 Aaron D. Gifford.  All rights reserved.
 224  *
 225  * Redistribution and use in source and binary forms, with or without
 226  * modification, are permitted provided that the following conditions
 227  * are met:
 228  * 1. Redistributions of source code must retain the above copyright
 229  *    notice, this list of conditions and the following disclaimer.
 230  * 2. Redistributions in binary form must reproduce the above copyright
 231  *    notice, this list of conditions and the following disclaimer in the
 232  *    documentation and/or other materials provided with the distribution.
 233  * 3. Neither the name of the copyright holder nor the names of contributors
 234  *    may be used to endorse or promote products derived from this software
 235  *    without specific prior written permission.
 236  *
 237  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTOR(S) ``AS IS'' AND
 238  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 239  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 240  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTOR(S) BE LIABLE
 241  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 242  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 243  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 244  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 245  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 246  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 247  * SUCH DAMAGE.
 248  *
 249  */
 250
 251 ------------------------------------------------------------------------------
 252 ------------------------------------------------------------------------------
 253
 254 /*-
 255  *  COPYRIGHT (C) 1986 Gary S. Brown.  You may use this program, or
 256  *  code or tables extracted from it, as desired without restriction.
 257  *
 258  *  First, the polynomial itself and its table of feedback terms.  The
 259  *  polynomial is
 260  *  X^32+X^26+X^23+X^22+X^16+X^12+X^11+X^10+X^8+X^7+X^5+X^4+X^2+X^1+X^0
 261  *
 262  *  Note that we take it "backwards" and put the highest-order term in
 263  *  the lowest-order bit.  The X^32 term is "implied"; the LSB is the
 264  *  X^31 term, etc.  The X^0 term (usually shown as "+1") results in
 265  *  the MSB being 1
 266  *
 267  *  Note that the usual hardware shift register implementation, which
 268  *  is what we're using (we're merely optimizing it by doing eight-bit
 269  *  chunks at a time) shifts bits into the lowest-order term.  In our
 270  *  implementation, that means shifting towards the right.  Why do we
 271  *  do it this way?  Because the calculated CRC must be transmitted in
 272  *  order from highest-order term to lowest-order term.  UARTs transmit
 273  *  characters in order from LSB to MSB.  By storing the CRC this way
 274  *  we hand it to the UART in the order low-byte to high-byte; the UART
 275  *  sends each low-bit to hight-bit; and the result is transmission bit
 276  *  by bit from highest- to lowest-order term without requiring any bit
 277  *  shuffling on our part.  Reception works similarly
 278  *
 279  *  The feedback terms table consists of 256, 32-bit entries.  Notes
 280  *
 281  *      The table can be generated at runtime if desired; code to do so
 282  *      is shown later.  It might not be obvious, but the feedback
 283  *      terms simply represent the results of eight shift/xor opera
 284  *      tions for all combinations of data and CRC register values
 285  *
 286  *      The values must be right-shifted by eight bits by the "updcrc
 287  *      logic; the shift must be unsigned (bring in zeroes).  On some
 288  *      hardware you could probably optimize the shift in assembler by
 289  *      using byte-swap instructions
 290  *      polynomial $edb88320
 291  *
 292
 293
 294  ------------------------------------------------------------------------------
 295
 296  /*
 297    The AES algorithm Rijndael implemented for block and key sizes of 128,
 298    192 and 256 bits (16, 24 and 32 bytes) by Brian Gladman.
 299
 300    I retain copyright in this code but I encourage its free use provided
 301    that I don't carry any responsibility for the results. I am especially
 302    happy to see it used in free and open source software. If you do use
 303    it I would appreciate an acknowledgement of its origin in the code or
 304    the product that results and I would also appreciate knowing a liitle
 305    about the use to which it is being put. I am grateful to Frank Yellin
 306    for some ideas that are used in this implementation.
 307
 308    Dr B. R. Gladman <brg@gladman.uk.net> 1st June 2001.
 309
 310  ------------------------------------------------------------------------------
 311
 312  /*
 313  * hash_32 - 32 bit Fowler/Noll/Vo hash code
 314  *
 315  * Fowler/Noll/Vo hash
 316  *
 317  * Please do not copyright this code.  This code is in the public domain.
 318  *
 319  * LANDON CURT NOLL DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
 320  * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO
 321  * EVENT SHALL LANDON CURT NOLL BE LIABLE FOR ANY SPECIAL, INDIRECT OR
 322  * CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF
 323  * USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
 324  * OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
 325  * PERFORMANCE OF THIS SOFTWARE.
 326  *
 327  ------------------------------------------------------------------------------
 328  /*
 329  * sha1.c
 330  *
 331  * Originally witten by Steve Reid <steve@edmweb.com>
 332  *
 333  * Modified by Aaron D. Gifford <agifford@infowest.com>
 334  *
 335  * NO COPYRIGHT - THIS IS 100% IN THE PUBLIC DOMAIN
 336  *
 337  * The original unmodified version is available at:
 338  *    ftp://ftp.funet.fi/pub/crypt/hash/sha/sha1.c
 339  *
 340  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTORS ``AS IS'' AND
 341  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 342  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 343  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTORS BE LIABLE
 344  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 345  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 346  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 347  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 348  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 349  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 350  * SUCH DAMAGE.
 351  */
 352
 353 ------------------------------------------------------------------------------
 354
 355 /*
 356  * AES-based functions
 357  *
 358  * - AES Key Wrap Algorithm (128-bit KEK) (RFC3394)
 359  * - One-Key CBC MAC (OMAC1) hash with AES-128
 360  * - AES-128 CTR mode encryption
 361  * - AES-128 EAX mode encryption/decryption
 362  * - AES-128 CBC
 363  *
 364  * Copyright (c) 2003-2005, Jouni Malinen <jkmaline@cc.hut.fi>
 365  *
 366  * This program is free software; you can redistribute it and/or modify
 367  * it under the terms of the GNU General Public License version 2 as
 368  * published by the Free Software Foundation.
 369  *
 370  * Alternatively, this software may be distributed under the terms of BSD
 371  * license.
 372  *
 373  * See README and COPYING for more details.
 374  */
 375  ------------------------------------------------------------------------------
 376  /*
 377  * SHA1 hash implementation and interface functions
 378  * Copyright (c) 2003-2005, Jouni Malinen <jkmaline@cc.hut.fi>
 379  *
 380  * This program is free software; you can redistribute it and/or modify
 381  * it under the terms of the GNU General Public License version 2 as
 382  * published by the Free Software Foundation.
 383  *
 384  * Alternatively, this software may be distributed under the terms of BSD
 385  * license.
 386  *
 387  * See README and COPYING for more details.
 388  */
 389  ------------------------------------------------------------------------------
 390  /*
 391  * hmac_sha1.c
 392  *
 393  * Version 1.0.0
 394  *
 395  * Written by Aaron D. Gifford <me@aarongifford.com>
 396  *
 397  * Copyright 1998, 2000 Aaron D. Gifford.  All rights reserved.
 398  *
 399  * Redistribution and use in source and binary forms, with or without
 400  * modification, are permitted provided that the following conditions
 401  * are met:
 402  * 1. Redistributions of source code must retain the above copyright
 403  *    notice, this list of conditions and the following disclaimer.
 404  * 2. Redistributions in binary form must reproduce the above copyright
 405  *    notice, this list of conditions and the following disclaimer in the
 406  *    documentation and/or other materials provided with the distribution.
 407  * 3. Neither the name of the copyright holder nor the names of contributors
 408  *    may be used to endorse or promote products derived from this software
 409  *    without specific prior written permission.
 410  *
 411  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTORS ``AS IS'' AND
 412  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 413  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 414  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTORS BE LIABLE
 415  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 416  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 417  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 418  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 419  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 420  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 421  * SUCH DAMAGE.
 422  */
 423 ------------------------------------------------------------------------------
 424 ------------------------------------------------------------------------------
 425
 426 /*
 427 * AUTHOR:   Aaron D. Gifford <me@aarongifford.com>
 428 *
 429 * Copyright (c) 2000-2001, Aaron D. Gifford
 430 * All rights reserved.
 431 *
 432 * Redistribution and use in source and binary forms, with or without
 433 * modification, are permitted provided that the following conditions
 434 * are met:
 435 * 1. Redistributions of source code must retain the above copyright
 436 * notice, this list of conditions and the following disclaimer.
 437 * 2. Redistributions in binary form must reproduce the above copyright
 438 * notice, this list of conditions and the following disclaimer in the
 439 * documentation and/or other materials provided with the distribution.
 440 * 3. Neither the name of the copyright holder nor the names of contributors
 441 * may be used to endorse or promote products derived from this software
 442 * without specific prior written permission.
 443 *
 444 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) "AS IS" AND
 445 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 446 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 447 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
 448 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 449 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 450 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 451 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 452 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 453 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 454 * SUCH DAMAGE.
 455 */
 456
 457 ------------------------------------------------------------------------------
 458
 459 /*
 460  * Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
 461  * All rights reserved.
 462  *
 463  * Redistribution and use in source and binary forms, with or without
 464  * modification, are permitted provided that the following conditions
 465  * are met:
 466  * 1. Redistributions of source code must retain the above copyright
 467  * notice, this list of conditions and the following disclaimer.
 468  * 2. Redistributions in binary form must reproduce the above copyright
 469  * notice, this list of conditions and the following disclaimer in the
 470  * documentation and/or other materials provided with the distribution.
 471  * 3. The name of the author may not be used to endorse or promote products
 472  * derived from this software without specific prior written permission.
 473  *
 474  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
 475  * INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY
 476  * AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL
 477  * THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
 478  * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
 479  * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
 480  * OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
 481  * WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
 482  * OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
 483  * ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 484  */
 485
 486  ------------------------------------------------------------------------------
 487
 488  /*
 489  * Copyright (c) 1998 Todd C. Miller <Todd.Miller@courtesan.com>
 490  *
 491  * Permission to use, copy, modify, and distribute this software for any
 492  * purpose with or without fee is hereby granted, provided that the above
 493  * copyright notice and this permission notice appear in all copies.
 494  *
 495  * THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
 496  * WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
 497  * MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
 498  * ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
 499  * WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
 500  * ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
 501  * OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
 502  */
 503
 504
 505 ------------------------------------------------------------------------------
 506 ------------------------------------------------------------------------------