ruby_abc 0.0.6 → 0.1.0

data/ext/abc/src/misc/bbl/bblif.h

@@ -1,285 +0,0 @@
-/**CFile****************************************************************
-
-  FileName    [bblif.h]
-
-  SystemName  [ABC: Logic synthesis and verification system.]
-
-  PackageName [Binary BLIF representation for logic networks.]
-
-  Synopsis    [External declarations.]
-
-  Author      [Alan Mishchenko]
-  
-  Affiliation [UC Berkeley]
-
-  Date        [Ver. 1.0. Started - February 28, 2009.]
-
-  Revision    [$Id: bblif.h,v 1.00 2009/02/28 00:00:00 alanmi Exp $]
-
-***********************************************************************/
- 
-#ifndef ABC__aig__bbl__bblif_h
-#define ABC__aig__bbl__bblif_h
-
-
-/*
-    This file (taken together with "bblif.c") implements a stand-alone 
-    interface between ABC and an application that uses ABC. 
-    
-    The interface is designed to pass a combinational logic network 
-    from the calling application to ABC using a binary BLIF format (BBLIF) 
-    and return the network after synthesis/mapping/verification in ABC 
-    back to the caller.
-
-    The interface can do the following:
-    (1) accept a combinational logic network via a set of APIs
-    (2) write the logic network into a binary BLIF file readable by ABC
-    (3) read a binary BLIF file with a mapped network produced by ABC
-    (4) return the mapped network to the caller through a set of APIs
-
-    It should be noted that the BBLIF interface can be used to pass
-    the network from the calling application into ABC without writing it
-    into a file. In this case, ABC should be compiled as a library and
-    linked to the calling application. The BBLIF manager can be given
-    directly to the procedure Bbl_ManToAbc() to convert it into an AIG.
-    Similarly, the resulting mapped network can be converted into
-    BBLIF manager and passed back after the call to Bbl_ManFromAbc().
-
-    Here these steps are described in more detail:
-
-    (1) The BBLIF manager is allocated by calling Bbl_ManStart() and 
-        deallocated by calling Bbl_ManStop(). 
-    
-        The combinational network is composed of three types of objects:
-        (a) combinational inputs (CIs), (b) combinational outputs (COs), 
-        (c) internal logic nodes represented using Sum-of-Products (SOPs)
-        similar to the way logic nodes are represented in SIS. Sequential 
-        elements (flops) are currently not supported.   A CI has no fanins. 
-        A CO has exactly one fanin and no fanouts. Internal nodes can 
-        have any number of fanins and fanouts. Only an internal node can 
-        have a logic function.
-
-        Before constructing the BBLIF manager, each object should be 
-        assigned a unique non-negative (0-based) integer ID. The sequence
-        of ID numbers may have gaps in it (for example, 0, 1, 2, 5, 6, etc)
-        but care should be taken that the ID numbers do not grow too large
-        because internally they are used to index the objects. So if 
-        the largest given ID has value N, an array of 4*N bytes will be 
-        allocated internally by the BBLIF manager. Obviously if N = 1M, 
-        the array will use 4Mb, but if N = 100M, it will use 0.4Gb.
-
-        This object ID (called also "the original ID of the object") is 
-        given to Bbl_ManCreateObject(), which construct the BBLIF objects 
-        and to the procedure Bbl_ManAddFanin(), which creates fanin/fanout
-        relations between two objects.  The exact number of fanins of an
-        object should be declared when calling Bbl_ManCreateObject(). 
-        Later on, each node should be assigned as many fanins using 
-        Bbl_ManAddFanin(). The order/number of fanins corresponds to the 
-        order/number of variables in the SOP of the logic function of the 
-        node. The declared and actual number of fanins should be the same.
-        otherwise the interface will not function correctly. This is checked
-        by the procedure Bbl_ManCheck(), which should be called when 
-        constructing all objects and their fanins is finished.
-
-        The SOP representation of the logic function should be given to
-        every internal node. It is given as a C-string, showing the SOP
-        as it would appear in a BLIF or PLA file. Each cube is composed
-        of characters '0', '1', and '-', and ended by a seqence of three
-        characters: space ' ', followed by '0' or '1' (depending on whether 
-        on- or off-set is used), followed by the new line character '\n'. 
-        For example, a two-input OR has the following SOP representation: 
-        "1- 1\n-1 1\n", or equivalently, "00 0\n". The SOP for a constant 
-        function with no fanins is represented as " 0\n" (constant 0) and
-        " 1\n" (constant 1). SOP for a constant node with some fanins
-        may also be represented. For example, constant 0 node with three 
-        fanins will have SOP representation as follows: "--- 0\n".
-
-        The objects can be added to the BBLIF manager in any order, but 
-        by the time the fanin/fanout connections are created, corresponding 
-        objects should be already created.
-
-        The number of objects is limited by 2^31. The number of fanins
-        of one object is restricted to 2^28. The SOP representation can 
-        have arbitrary many products (cubes), as long as memory is enough
-        to represent them in the C-string form, as described above.
-
-    (2) To write the manager into a file, call procedure Bbl_ManDumpBinaryBlif().
-        It is recommended to use files with extension ".bblif" because it
-        will allow ABC to call the approapriate reader in command "read".
-
-    (3) To read the network from file, call procedure Bbl_ManReadBinaryBlif().
-
-    (4) It is assumed that ABC will return the network after mapping.
-        This network will arrive in a BBLIF file, from which the BBLIF 
-        manager is created by the call to Bbl_ManReadBinaryBlif(). The 
-        following APIs are useful to extract the mapped network from the manager:
-        
-        Iterator Bbl_ManForEachObj() iterates through the pointers to the
-        BBLIF objects, which are guaranteed to be in a topological order. 
-
-        For each object, the following APIs can be used:
-        Bbl_ObjIsInput() returns 1 if the object is a CI
-        Bbl_ObjIsOutput() returns 1 if the object is a CO
-        Bbl_ObjIsLut() returns 1 if the object is a logic node (lookup table)
-        Bbl_ObjFaninNumber() returns the number of fanins of the node
-        Bbl_ObjSop() returns the SOP representation of the node, as described above.
-
-        A special attention should be given to the representation of object IDs
-        after mapping. Recall that when the outgoing BBLIF network is constructed, 
-        the IDs of objects are assigned by the calling application and given to 
-        the BBLIF manager when procedure Bbl_ManCreateObject() is called.  
-        We refer to these object IDs as "original IDs of the objects". 
-        
-        When the network has been given to ABC, mapped, and returned to the 
-        calling application in the incoming BBLIF file, only CIs and COs are 
-        guaranteed to preserve their "original IDs". Other objects may be created 
-        during synthesis/mapping. The original IDs of these objects are set to -1. 
-
-        The following two APIs are used to return the IDs of objects after mapping:
-        Bbl_ObjId() returns the new ID (useful to construct network after mapping)
-        Bbl_ObjIdOriginal() returns the original ID (or -1 if this is a new object).
-
-        !!!***!!!
-        Note: The original ID currently cannot be returned by Bbl_ObjIdOriginal().
-        It is recommended to use the work-around described below.
-        !!!***!!!
-
-        The original ID is useful to map CIs/COs after mapping into CIs/COs before
-        mapping. However, the order of CIs/COs after mapping in the incoming network 
-        is the same as the order of their creation by the calling application 
-        in the outgoing network. This allows for a workaround that does not have 
-        the need for the original IDs.  We can simply iterate through the objects 
-        after mapping, and create CIs and COs in the order of their appearance, 
-        and this order is guaranteed to be the same as the order of their 
-        construction by the calling application.
-
-        It is also worth noting that currently the internal node names are not 
-        preserved by ABC during synthesis. This may change in the future. and then 
-        some of the internal nodes will preserve their IDs, which may allow the 
-        calling application to reconstruct the names of some of the nodes after 
-        synthesis/mapping in ABC using their original IDs whenever available.
-
-        Finally, iterator Bbl_ObjForEachFanin() can be used to iterate through 
-        the fanins of each mapped object. For CIs, there will be no fanins. 
-        For COs, there will be exactly one fanin. For the internal nodes (LUTs)
-        the number of fanins is the number of inputs of these nodes.
-
-    A demo of using this interface is included at the bottom of file "bblif.c" in 
-    procedure Bbl_ManSimpleDemo(). Additional examples can be found in the files
-    "abc\src\base\io\ioReadBblif.c" and "abc\src\base\io\ioWriteBblif.c". These
-    files illustrate how an ABC network is created from the BBLIF data manager 
-    and how the data manager is created from the ABC network. 
-    
-    Note that only the files "bblif.h" and "bblif.c" are needed for interfacing
-    the user's application with ABC, while other files should not be compiled 
-    as part of the application code.
-
-    Finally, a warning regarding endianness. The interface may not work 
-    if the BBLIF file is produced on a machine whose engianness is different 
-    from the machine, which is reading this file.
-*/
-
-////////////////////////////////////////////////////////////////////////
-///                          INCLUDES                                ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                         PARAMETERS                               ///
-////////////////////////////////////////////////////////////////////////
-
-
-
-ABC_NAMESPACE_HEADER_START
-
-
-#ifdef _WIN32
-#define inline __inline
-#endif
-
-////////////////////////////////////////////////////////////////////////
-///                         BASIC TYPES                              ///
-////////////////////////////////////////////////////////////////////////
-
-// object types
-typedef enum { 
-    BBL_OBJ_NONE,                // 0: non-existent object
-    BBL_OBJ_CI,                  // 1: primary input
-    BBL_OBJ_CO,                  // 2: primary output
-    BBL_OBJ_NODE,                // 3: buffer node
-    BBL_OBJ_VOID                 // 4: unused object
-} Bbl_Type_t;
-
-// data manager
-typedef struct Bbl_Man_t_ Bbl_Man_t;
-
-// data object
-typedef struct Bbl_Obj_t_ Bbl_Obj_t;
-
-////////////////////////////////////////////////////////////////////////
-///                      MACRO DEFINITIONS                           ///
-////////////////////////////////////////////////////////////////////////
-
-////////////////////////////////////////////////////////////////////////
-///                    FUNCTION DECLARATIONS                         ///
-////////////////////////////////////////////////////////////////////////
-
-// (1) creating the data manager in the application code
-extern Bbl_Man_t * Bbl_ManStart( char * pName );
-extern void        Bbl_ManCreateObject( Bbl_Man_t * p, Bbl_Type_t Type, int ObjId, int nFanins, char * pSop );
-extern void        Bbl_ManAddFanin( Bbl_Man_t * p, int ObjId, int FaninId );
-extern int         Bbl_ManCheck( Bbl_Man_t * p );
-extern void        Bbl_ManPrintStats( Bbl_Man_t * p );
-extern void        Bbl_ManStop( Bbl_Man_t * p );
-
-// (2) writing the data manager into file
-extern void        Bbl_ManDumpBinaryBlif( Bbl_Man_t * p, char * pFileName );
-
-// (3) reading the data manager from file
-extern Bbl_Man_t * Bbl_ManReadBinaryBlif( char * pFileName );
-
-// (4) returning the mapped network after reading the data manaager from file
-extern char *      Bbl_ManName( Bbl_Man_t * p );
-extern int         Bbl_ObjIsInput( Bbl_Obj_t * p );
-extern int         Bbl_ObjIsOutput( Bbl_Obj_t * p );
-extern int         Bbl_ObjIsLut( Bbl_Obj_t * p );
-extern int         Bbl_ObjId( Bbl_Obj_t * p );
-extern int         Bbl_ObjIdOriginal( Bbl_Man_t * pMan, Bbl_Obj_t * p );
-extern int         Bbl_ObjFaninNumber( Bbl_Obj_t * p );
-extern char *      Bbl_ObjSop( Bbl_Man_t * pMan, Bbl_Obj_t * p );
-
-// for the use in iterators only
-extern Bbl_Obj_t * Bbl_ManObjFirst( Bbl_Man_t * p );
-extern Bbl_Obj_t * Bbl_ManObjNext( Bbl_Man_t * p, Bbl_Obj_t * pObj );
-extern Bbl_Obj_t * Bbl_ObjFaninFirst( Bbl_Obj_t * p );
-extern Bbl_Obj_t * Bbl_ObjFaninNext( Bbl_Obj_t * p, Bbl_Obj_t * pPrev );
-
-// iterator through the objects
-#define Bbl_ManForEachObj( p, pObj )                \
-    for ( pObj = Bbl_ManObjFirst(p); pObj; pObj = Bbl_ManObjNext(p, pObj) )
-// iterator through the fanins fo the an object
-#define Bbl_ObjForEachFanin( pObj, pFanin )         \
-    for ( pFanin = Bbl_ObjFaninFirst(pObj); pFanin; pFanin = Bbl_ObjFaninNext(pObj, pFanin) )
-
-// these additional procedures are provided to transform truth tables into SOPs, and vice versa
-extern char *      Bbl_ManTruthToSop( unsigned * pTruth, int nVars );
-extern unsigned *  Bbl_ManSopToTruth( char * pSop, int nVars );
-
-// write text BLIF file for debugging
-extern void        Bbl_ManDumpBlif( Bbl_Man_t * p, char * pFileName );
-
-// a simple demo procedure
-extern void        Bbl_ManSimpleDemo();
-
-
-
-
-ABC_NAMESPACE_HEADER_END
-
-
-
-#endif
-
-////////////////////////////////////////////////////////////////////////
-///                       END OF FILE                                ///
-////////////////////////////////////////////////////////////////////////
-

data/ext/abc/src/misc/bbl/module.make

@@ -1 +0,0 @@
-SRC +=	src/misc/bbl/bblif.c 

data/ext/abc/src/misc/bzlib/CHANGES

@@ -1,319 +0,0 @@
- ------------------------------------------------------------------
- This file is part of bzip2/libbzip2, a program and library for
- lossless, block-sorting data compression.
-
- bzip2/libbzip2 version 1.0.5 of 10 December 2007
- Copyright (C) 1996-2007 Julian Seward <jseward@bzip.org>
-
- Please read the WARNING, DISCLAIMER and PATENTS sections in the 
- README file.
-
- This program is released under the terms of the license contained
- in the file LICENSE.
- ------------------------------------------------------------------
-
-
-0.9.0
-~~~~~
-First version.
-
-
-0.9.0a
-~~~~~~
-Removed 'ranlib' from Makefile, since most modern Unix-es 
-don't need it, or even know about it.
-
-
-0.9.0b
-~~~~~~
-Fixed a problem with error reporting in bzip2.c.  This does not effect
-the library in any way.  Problem is: versions 0.9.0 and 0.9.0a (of the
-program proper) compress and decompress correctly, but give misleading
-error messages (internal panics) when an I/O error occurs, instead of
-reporting the problem correctly.  This shouldn't give any data loss
-(as far as I can see), but is confusing.
-
-Made the inline declarations disappear for non-GCC compilers.
-
-
-0.9.0c
-~~~~~~
-Fixed some problems in the library pertaining to some boundary cases.
-This makes the library behave more correctly in those situations.  The
-fixes apply only to features (calls and parameters) not used by
-bzip2.c, so the non-fixedness of them in previous versions has no
-effect on reliability of bzip2.c.
-
-In bzlib.c:
-   * made zero-length BZ_FLUSH work correctly in bzCompress().
-   * fixed bzWrite/bzRead to ignore zero-length requests.
-   * fixed bzread to correctly handle read requests after EOF.
-   * wrong parameter order in call to bzDecompressInit in
-     bzBuffToBuffDecompress.  Fixed.
-
-In compress.c:
-   * changed setting of nGroups in sendMTFValues() so as to 
-     do a bit better on small files.  This _does_ effect
-     bzip2.c.
-
-
-0.9.5a
-~~~~~~
-Major change: add a fallback sorting algorithm (blocksort.c)
-to give reasonable behaviour even for very repetitive inputs.
-Nuked --repetitive-best and --repetitive-fast since they are
-no longer useful.
-
-Minor changes: mostly a whole bunch of small changes/
-bugfixes in the driver (bzip2.c).  Changes pertaining to the
-user interface are:
-
-   allow decompression of symlink'd files to stdout
-   decompress/test files even without .bz2 extension
-   give more accurate error messages for I/O errors
-   when compressing/decompressing to stdout, don't catch control-C
-   read flags from BZIP2 and BZIP environment variables
-   decline to break hard links to a file unless forced with -f
-   allow -c flag even with no filenames
-   preserve file ownerships as far as possible
-   make -s -1 give the expected block size (100k)
-   add a flag -q --quiet to suppress nonessential warnings
-   stop decoding flags after --, so files beginning in - can be handled
-   resolved inconsistent naming: bzcat or bz2cat ?
-   bzip2 --help now returns 0
-
-Programming-level changes are:
-
-   fixed syntax error in GET_LL4 for Borland C++ 5.02
-   let bzBuffToBuffDecompress return BZ_DATA_ERROR{_MAGIC}
-   fix overshoot of mode-string end in bzopen_or_bzdopen
-   wrapped bzlib.h in #ifdef __cplusplus ... extern "C" { ... }
-   close file handles under all error conditions
-   added minor mods so it compiles with DJGPP out of the box
-   fixed Makefile so it doesn't give problems with BSD make
-   fix uninitialised memory reads in dlltest.c
-
-0.9.5b
-~~~~~~
-Open stdin/stdout in binary mode for DJGPP.
-
-0.9.5c
-~~~~~~
-Changed BZ_N_OVERSHOOT to be ... + 2 instead of ... + 1.  The + 1
-version could cause the sorted order to be wrong in some extremely
-obscure cases.  Also changed setting of quadrant in blocksort.c.
-
-0.9.5d
-~~~~~~
-The only functional change is to make bzlibVersion() in the library
-return the correct string.  This has no effect whatsoever on the
-functioning of the bzip2 program or library.  Added a couple of casts
-so the library compiles without warnings at level 3 in MS Visual
-Studio 6.0.  Included a Y2K statement in the file Y2K_INFO.  All other
-changes are minor documentation changes.
-
-1.0
-~~~
-Several minor bugfixes and enhancements:
-
-* Large file support.  The library uses 64-bit counters to
-  count the volume of data passing through it.  bzip2.c 
-  is now compiled with -D_FILE_OFFSET_BITS=64 to get large
-  file support from the C library.  -v correctly prints out
-  file sizes greater than 4 gigabytes.  All these changes have
-  been made without assuming a 64-bit platform or a C compiler
-  which supports 64-bit ints, so, except for the C library
-  aspect, they are fully portable.
-
-* Decompression robustness.  The library/program should be
-  robust to any corruption of compressed data, detecting and
-  handling _all_ corruption, instead of merely relying on
-  the CRCs.  What this means is that the program should 
-  never crash, given corrupted data, and the library should
-  always return BZ_DATA_ERROR.
-
-* Fixed an obscure race-condition bug only ever observed on
-  Solaris, in which, if you were very unlucky and issued
-  control-C at exactly the wrong time, both input and output
-  files would be deleted.
-
-* Don't run out of file handles on test/decompression when
-  large numbers of files have invalid magic numbers.
-
-* Avoid library namespace pollution.  Prefix all exported 
-  symbols with BZ2_.
-
-* Minor sorting enhancements from my DCC2000 paper.
-
-* Advance the version number to 1.0, so as to counteract the
-  (false-in-this-case) impression some people have that programs 
-  with version numbers less than 1.0 are in some way, experimental,
-  pre-release versions.
-
-* Create an initial Makefile-libbz2_so to build a shared library.
-  Yes, I know I should really use libtool et al ...
-
-* Make the program exit with 2 instead of 0 when decompression
-  fails due to a bad magic number (ie, an invalid bzip2 header).
-  Also exit with 1 (as the manual claims :-) whenever a diagnostic
-  message would have been printed AND the corresponding operation 
-  is aborted, for example
-     bzip2: Output file xx already exists.
-  When a diagnostic message is printed but the operation is not 
-  aborted, for example
-     bzip2: Can't guess original name for wurble -- using wurble.out
-  then the exit value 0 is returned, unless some other problem is
-  also detected.
-
-  I think it corresponds more closely to what the manual claims now.
-
-
-1.0.1
-~~~~~
-* Modified dlltest.c so it uses the new BZ2_ naming scheme.
-* Modified makefile-msc to fix minor build probs on Win2k.
-* Updated README.COMPILATION.PROBLEMS.
-
-There are no functionality changes or bug fixes relative to version
-1.0.0.  This is just a documentation update + a fix for minor Win32
-build problems.  For almost everyone, upgrading from 1.0.0 to 1.0.1 is
-utterly pointless.  Don't bother.
-
-
-1.0.2
-~~~~~
-A bug fix release, addressing various minor issues which have appeared
-in the 18 or so months since 1.0.1 was released.  Most of the fixes
-are to do with file-handling or documentation bugs.  To the best of my
-knowledge, there have been no data-loss-causing bugs reported in the
-compression/decompression engine of 1.0.0 or 1.0.1.
-
-Note that this release does not improve the rather crude build system
-for Unix platforms.  The general plan here is to autoconfiscate/
-libtoolise 1.0.2 soon after release, and release the result as 1.1.0
-or perhaps 1.2.0.  That, however, is still just a plan at this point.
-
-Here are the changes in 1.0.2.  Bug-reporters and/or patch-senders in
-parentheses.
-
-* Fix an infinite segfault loop in 1.0.1 when a directory is
-  encountered in -f (force) mode.
-     (Trond Eivind Glomsrod, Nicholas Nethercote, Volker Schmidt)
-
-* Avoid double fclose() of output file on certain I/O error paths.
-     (Solar Designer)
-
-* Don't fail with internal error 1007 when fed a long stream (> 48MB)
-  of byte 251.  Also print useful message suggesting that 1007s may be
-  caused by bad memory.
-     (noticed by Juan Pedro Vallejo, fixed by me)
-
-* Fix uninitialised variable silly bug in demo prog dlltest.c.
-     (Jorj Bauer)
-
-* Remove 512-MB limitation on recovered file size for bzip2recover
-  on selected platforms which support 64-bit ints.  At the moment
-  all GCC supported platforms, and Win32.
-     (me, Alson van der Meulen)
-
-* Hard-code header byte values, to give correct operation on platforms
-  using EBCDIC as their native character set (IBM's OS/390).
-     (Leland Lucius)
-
-* Copy file access times correctly.
-     (Marty Leisner)
-
-* Add distclean and check targets to Makefile.
-     (Michael Carmack)
-
-* Parameterise use of ar and ranlib in Makefile.  Also add $(LDFLAGS).
-     (Rich Ireland, Bo Thorsen)
-
-* Pass -p (create parent dirs as needed) to mkdir during make install.
-     (Jeremy Fusco)
-
-* Dereference symlinks when copying file permissions in -f mode.
-     (Volker Schmidt)
-
-* Majorly simplify implementation of uInt64_qrm10.
-     (Bo Lindbergh)
-
-* Check the input file still exists before deleting the output one,
-  when aborting in cleanUpAndFail().
-     (Joerg Prante, Robert Linden, Matthias Krings)
-
-Also a bunch of patches courtesy of Philippe Troin, the Debian maintainer
-of bzip2:
-
-* Wrapper scripts (with manpages): bzdiff, bzgrep, bzmore.
-
-* Spelling changes and minor enhancements in bzip2.1.
-
-* Avoid race condition between creating the output file and setting its
-  interim permissions safely, by using fopen_output_safely().
-  No changes to bzip2recover since there is no issue with file
-  permissions there.
-
-* do not print senseless report with -v when compressing an empty
-  file.
-
-* bzcat -f works on non-bzip2 files.
-
-* do not try to escape shell meta-characters on unix (the shell takes
-  care of these).
-
-* added --fast and --best aliases for -1 -9 for gzip compatibility.
-
-
-1.0.3 (15 Feb 05)
-~~~~~~~~~~~~~~~~~
-Fixes some minor bugs since the last version, 1.0.2.
-
-* Further robustification against corrupted compressed data.
-  There are currently no known bitstreams which can cause the
-  decompressor to crash, loop or access memory which does not
-  belong to it.  If you are using bzip2 or the library to 
-  decompress bitstreams from untrusted sources, an upgrade
-  to 1.0.3 is recommended.  This fixes CAN-2005-1260.
-
-* The documentation has been converted to XML, from which html
-  and pdf can be derived.
-
-* Various minor bugs in the documentation have been fixed.
-
-* Fixes for various compilation warnings with newer versions of
-  gcc, and on 64-bit platforms.
-
-* The BZ_NO_STDIO cpp symbol was not properly observed in 1.0.2.
-  This has been fixed.
-
-
-1.0.4 (20 Dec 06)
-~~~~~~~~~~~~~~~~~
-Fixes some minor bugs since the last version, 1.0.3.
-
-* Fix file permissions race problem (CAN-2005-0953).
-
-* Avoid possible segfault in BZ2_bzclose.  From Coverity's NetBSD
-  scan.
-
-* 'const'/prototype cleanups in the C code.
-
-* Change default install location to /usr/local, and handle multiple
-  'make install's without error.
-
-* Sanitise file names more carefully in bzgrep.  Fixes CAN-2005-0758
-  to the extent that applies to bzgrep.
-
-* Use 'mktemp' rather than 'tempfile' in bzdiff.
-
-* Tighten up a couple of assertions in blocksort.c following automated
-  analysis.
-
-* Fix minor doc/comment bugs.
-
-
-1.0.5 (10 Dec 07)
-~~~~~~~~~~~~~~~~~
-Security fix only.  Fixes CERT-FI 20469 as it applies to bzip2.
-

data/ext/abc/src/misc/bzlib/LICENSE

@@ -1,42 +0,0 @@
-
---------------------------------------------------------------------------
-
-This program, "bzip2", the associated library "libbzip2", and all
-documentation, are copyright (C) 1996-2007 Julian R Seward.  All
-rights reserved.
-
-Redistribution and use in source and binary forms, with or without
-modification, are permitted provided that the following conditions
-are met:
-
-1. Redistributions of source code must retain the above copyright
-   notice, this list of conditions and the following disclaimer.
-
-2. The origin of this software must not be misrepresented; you must 
-   not claim that you wrote the original software.  If you use this 
-   software in a product, an acknowledgment in the product 
-   documentation would be appreciated but is not required.
-
-3. Altered source versions must be plainly marked as such, and must
-   not be misrepresented as being the original software.
-
-4. The name of the author may not be used to endorse or promote 
-   products derived from this software without specific prior written 
-   permission.
-
-THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
-OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
-WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
-DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
-GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
-WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
-NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
-SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-
-Julian Seward, jseward@bzip.org
-bzip2/libbzip2 version 1.0.5 of 10 December 2007
-
---------------------------------------------------------------------------