开源软件构建与测试

_service:tar_scm:perl-Compress-Raw-Bzip2.spec Changed

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.appveyor.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.cirrus.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/linux-upstream-gitlab.yml Added

@@ -0,0 +1,84 @@
+name: Linux + Upstream Bzip2 1.1
+
+on:
+  workflow_dispatch:
+  push:
+  pull_request:
+  schedule:
+      - cron: '02 02 * * 6'    # Run every Saturday
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    strategy:
+      matrix:
+        perl:
+          - '5.38'
+          # - '5.36'
+          # - '5.34'
+          # - '5.32'
+          # - '5.30'
+          # - '5.28'
+          # - '5.26'
+          # - '5.24'
+          # - '5.22'
+          # - '5.20'
+          # - '5.18'
+          # - '5.16'
+          # - '5.14'
+          # - '5.12'
+          # - '5.10'
+          # - '5.8'
+          # - '5.6'
+        bzip2-version:
+          - master
+
+    name: Perl ${{ matrix.perl }} + Upstream '${{ matrix.bzip2-version }}'
+    steps:
+    - uses: actions/checkout@v3
+
+    - name: Set Env
+      run: |
+        echo "bzip2-source=${GITHUB_WORKSPACE}/upstream-bzip2-source-${{ matrix.bzip2-version }}"         >> $GITHUB_ENV
+        echo "bzip2-install=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"                   >> $GITHUB_ENV
+        echo "BZIP2_LIB=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}/usr/local/lib"         >> $GITHUB_ENV
+        echo "BZIP2_INCLUDE=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}/usr/local/include" >> $GITHUB_ENV
+        echo "BZIP2_VERSION=${{ matrix.bzip2-version }}"                                                  >> $GITHUB_ENV
+        echo "BUILD_BZIP2=0"                                                                              >> $GITHUB_ENV
+
+    - name: Checkout upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir -p ${{ env.bzip2-source }}
+        cd ${{ env.bzip2-source }}
+        git clone https://gitlab.com/bzip2/bzip2.git .
+
+    - name: Build upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir build
+        cd build
+        cmake ..
+        make DESTDIR=${{ env.bzip2-install }} install
+        make clean
+      working-directory: ${{ env.bzip2-source }}
+
+    - name: Setup perl
+      uses: shogo82148/actions-setup-perl@v1
+      with:
+        perl-version: ${{ matrix.perl }}
+
+    - name: Perl version
+      run: perl -V
+
+    # - name: Install dependencies
+    #   run: cpanm --quiet --installdeps --notest .
+
+    - name: Build
+      run: perl Makefile.PL && make
+
+    - name: Test
+      run: make test
+
+    - name: Bzip2 Version
+      run: perl -Mblib -MCompress::Raw::Bzip2 -e 'print Compress::Raw::Bzip2::bzlibversion(). "\n"'
\ No newline at end of file

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/linux-upstream-sourceware.yml Added

@@ -0,0 +1,84 @@
+name: Linux + Upstream Bzip2 1.0
+
+on:
+  workflow_dispatch:
+  push:
+  pull_request:
+  schedule:
+      - cron: '02 02 * * 6'    # Run every Saturday
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    strategy:
+      matrix:
+        perl:
+          - '5.38'
+          # - '5.36'
+          # - '5.34'
+          # - '5.32'
+          # - '5.30'
+          # - '5.28'
+          # - '5.26'
+          # - '5.24'
+          # - '5.22'
+          # - '5.20'
+          # - '5.18'
+          # - '5.16'
+          # - '5.14'
+          # - '5.12'
+          # - '5.10'
+          # - '5.8'
+          # - '5.6'
+        bzip2-version:
+          - master
+
+    name: Perl ${{ matrix.perl }} + Upstream '${{ matrix.bzip2-version }}'
+    steps:
+    - uses: actions/checkout@v3
+
+    - name: Set Env
+      run: |
+        echo "bzip2-source=${GITHUB_WORKSPACE}/upstream-bzip2-source-${{ matrix.bzip2-version }}" >> $GITHUB_ENV
+        echo "bzip2-install=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"           >> $GITHUB_ENV
+        echo "BZIP2_LIB=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"               >> $GITHUB_ENV
+        echo "BZIP2_INCLUDE=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"           >> $GITHUB_ENV
+        echo "BZIP2_VERSION=${{ matrix.bzip2-version }}"                                          >> $GITHUB_ENV
+        echo "BUILD_BZIP2=0"                                                                      >> $GITHUB_ENV
+
+    - name: Checkout upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir -p ${{ env.bzip2-source }}
+        cd ${{ env.bzip2-source }}
+        git clone https://sourceware.org/git/bzip2.git .
+
+    - name: Build upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        make -f Makefile-libbz2_so
+        mkdir -p ${{ env.bzip2-install }}
+        cp bzlib.h libbz2.so* ${{ env.bzip2-install }}
+        make clean
+        rm libbz2.so*
+      working-directory: ${{ env.bzip2-source }}
+
+    - name: Setup perl
+      uses: shogo82148/actions-setup-perl@v1
+      with:
+        perl-version: ${{ matrix.perl }}
+
+    - name: Perl version
+      run: perl -V
+
+    - name: Install dependencies
+      run: cpanm --quiet --installdeps --notest .
+
+    - name: Build
+      run: perl Makefile.PL && make
+
+    - name: Test
+      run: make test
+
+    - name: Bzip2 Version
+      run: perl -Mblib -MCompress::Raw::Bzip2 -e 'print Compress::Raw::Bzip2::bzlibversion(). "\n"'
\ No newline at end of file

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/linux.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/macos-upstream-gitlab.yml Added

@@ -0,0 +1,81 @@
+name: MacOS + Upstream Bzip2 1.1
+
+on:
+  workflow_dispatch:
+  push:
+  pull_request:
+  schedule:
+      - cron: '02 02 * * 6'    # Run every Saturday
+
+jobs:
+  build:
+
+    runs-on: macos-latest
+
+    strategy:
+      matrix:
+        perl:
+          - '5.38'
+          # - '5.36'
+          # - '5.34'
+          # - '5.32'
+          # - '5.30'
+          # - '5.28'
+          # - '5.26'
+          # - '5.24'
+          # - '5.22'
+          # - '5.20'
+          # - '5.18'
+          # - '5.16'
+          # - '5.14'
+          # - '5.12'
+          # - '5.10'
+          # - '5.8'
+          # - '5.6'
+        bzip2-version:
+          - master
+
+    name: Perl ${{ matrix.perl }} + Upstream '${{ matrix.bzip2-version }}'
+    steps:
+    - uses: actions/checkout@v3
+
+    - name: Set Env
+      run: |
+        echo "bzip2-source=${GITHUB_WORKSPACE}/upstream-bzip2-source-${{ matrix.bzip2-version }}"         >> $GITHUB_ENV
+        echo "bzip2-install=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"                   >> $GITHUB_ENV
+        echo "BZIP2_LIB=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}/usr/local/lib"         >> $GITHUB_ENV
+        echo "BZIP2_INCLUDE=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}/usr/local/include" >> $GITHUB_ENV
+        echo "BZIP2_VERSION=${{ matrix.bzip2-version }}"                                                  >> $GITHUB_ENV
+        echo "BUILD_BZIP2=0"                                                                              >> $GITHUB_ENV
+
+    - name: Checkout upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir -p ${{ env.bzip2-source }}
+        cd ${{ env.bzip2-source }}
+        git clone https://gitlab.com/bzip2/bzip2.git .
+
+    - name: Build upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir build
+        cd build
+        cmake ..
+        make DESTDIR=${{ env.bzip2-install }} install
+        make clean
+      working-directory: ${{ env.bzip2-source }}
+
+    - name: Setup perl
+      uses: shogo82148/actions-setup-perl@v1
+      with:
+        perl-version: ${{ matrix.perl }}
+
+    - name: Perl version
+      run: perl -V
+
+    # - name: Install dependencies
+    #   run: cpanm --quiet --installdeps --notest .
+
+    - name: Build
+      run: perl Makefile.PL && make
+
+    - name: Test
+      run: make test
\ No newline at end of file

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/macos-upstream-sourceware.yml Added

@@ -0,0 +1,90 @@
+name: MacOS + Upstream Bzip2 1.0
+
+on:
+  workflow_dispatch:
+  push:
+  pull_request:
+  schedule:
+      - cron: '02 02 * * 6'    # Run every Saturday
+
+jobs:
+  build:
+
+    runs-on: macos-latest
+
+    strategy:
+      matrix:
+        perl:
+          - '5.38'
+          # - '5.36'
+          # - '5.34'
+          # - '5.32'
+          # - '5.30'
+          # - '5.28'
+          # - '5.26'
+          # - '5.24'
+          # - '5.22'
+          # - '5.20'
+          # - '5.18'
+          # - '5.16'
+          # - '5.14'
+          # - '5.12'
+          # - '5.10'
+          # - '5.8'
+          # - '5.6'
+        bzip2-version:
+          - master
+
+    name: Perl ${{ matrix.perl }} + Upstream '${{ matrix.bzip2-version }}'
+    steps:
+    - uses: actions/checkout@v3
+
+    - name: Set Env
+      run: |
+        echo "bzip2-source=${GITHUB_WORKSPACE}/upstream-bzip2-source-${{ matrix.bzip2-version }}" >> $GITHUB_ENV
+        echo "bzip2-install=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"           >> $GITHUB_ENV
+        echo "BZIP2_LIB=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"               >> $GITHUB_ENV
+        echo "BZIP2_INCLUDE=${HOME}/upstream-bzip2-install-${{ matrix.bzip2-version }}"           >> $GITHUB_ENV
+        # echo "BZIP2_VERSION=${{ matrix.bzip2-version }}"                                        >> $GITHUB_ENV
+        echo "BZIP2_VERSION=1.0.999"                                                              >> $GITHUB_ENV
+        echo "BUILD_BZIP2=0"                                                                      >> $GITHUB_ENV
+
+    - name: Checkout upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        mkdir -p ${{ env.bzip2-source }}
+        cd ${{ env.bzip2-source }}
+        git clone https://sourceware.org/git/bzip2.git .
+        sed -i -e s'/BZ_VERSION  "1.0.8.*"/BZ_VERSION "${{ env.BZIP2_VERSION }}"/' bzlib_private.h
+
+    # mac makefile sourced from https://stackoverflow.com/questions/67179779/building-and-installing-bzip2-with-shared-library-dylib-on-macos
+    - name: Build upstream bzip2 '${{matrix.bzip2-version}}''
+      run: |
+        #wget -c https://gist.githubusercontent.com/obihill/3278c17bcee41c0c8b59a41ada8c0d35/raw/3bf890e2ad40d0af358e153395c228326f0b44d5/Makefile-libbz2_dylib
+        #make -f Makefile-libbz2_dylib
+        gcc --shared -Wl,-install_name -Wl,libbz2.dylib -fpic -fPIC -Wall -Winline -O2 -g -D_FILE_OFFSET_BITS=64  blocksort.c huffman.c crctable.c randtable.c compress.c decompress.c bzlib.c  -o libbz2.${{ env.BZIP2_VERSION }}.dylib
+        ln -s libbz2.${{ env.BZIP2_VERSION }}.dylib libbz2.dylib
+        mkdir -p ${{ env.bzip2-install }}
+        cp bzlib.h libbz2.${{ env.BZIP2_VERSION }}.dylib libbz2.dylib ${{ env.bzip2-install }}
+        # make clean
+        rm  libbz2.${{ env.BZIP2_VERSION }}.dylib libbz2.dylib
+      working-directory: ${{ env.bzip2-source }}
+
+    - name: Setup perl
+      uses: shogo82148/actions-setup-perl@v1
+      with:
+        perl-version: ${{ matrix.perl }}
+
+    - name: Perl version
+      run: perl -V
+
+    - name: Install dependencies
+      run: cpanm --quiet --installdeps --notest .
+
+    - name: Build
+      run: perl Makefile.PL && make
+
+    - name: Test
+      run: make test
+
+    - name:  Bzip2 Version
+      run: perl -Mblib -MCompress::Raw::Bzip2 -e 'print Compress::Raw::Bzip2::bzlibversion(). "\n"'
\ No newline at end of file

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/macos.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.github/workflows/windows.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.gitignore Added

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/.travis.yml Added

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/Bzip2.xs -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/Bzip2.xs Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/Changes -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/Changes Changed

@@ -1,6 +1,53 @@
 CHANGES
 -------
 
+  2.205 8 February 2023
+
+    * 2.205
+      Sun, 16 Jul 2023 16:21:33 +0100
+      62de94af7f8328691abbadbeeb0f2b5effc551b2
+
+    * Test::More::isn't warns in perl 5.38
+      Sun, 9 Jul 2023 21:52:47 +0100
+      cab526b7f1d8fed30e30f3a16c07af66d5b4d4b5
+
+    * Add perl 5.38 & run cron for upstream repos
+      Sun, 9 Jul 2023 21:49:34 +0100
+      6c9f55033f725eab641411a1ac7f54f26250eeef
+
+    * add on workflow_dispatch
+      Fri, 9 Jun 2023 16:32:22 +0100
+      4d3a1d1a261be3599eee48ba28c349a7fc0f1750
+
+    * fix reference to github issue
+      Mon, 22 May 2023 12:37:07 +0100
+      edcb04c0b3bdbc2893654fcc7600474ba090c77a
+
+    * Fix to allow building with C++17 register keyword not allowed in C++17 https://github.com/pmqs/Compress-Raw-Bzip2/issues/11
+      Mon, 22 May 2023 12:29:30 +0100
+      9357289d218d14d64fc31cfa8ae5746a6dcbfca3
+
+    * Silence warnings on HPUX https://github.com/pmqs/Compress-Raw-Bzip2/issues/10
+      Thu, 23 Mar 2023 14:05:43 +0000
+      1418b2afd5b16bb9ddbc19e377c16c6af113d64f
+
+  2.204 8 February 2023
+
+    * Cast isdigit argument as unsigned char
+      https://github.com/pmqs/Compress-Raw-Bzip2/pull/9
+      967696b4fa91768fa4d46163f46982bc063a175e
+
+    * Use GIMME_V instead of GIMME
+      https://github.com/pmqs/Compress-Raw-Bzip2/pull/8
+      54e3c1e18b61f0892056925240bbc80f76e2f038
+
+    * typos
+      12496575c17829506cc9c9fa325e31aab1fcd1c7
+
+    * Trim trailing spaces from bzip2-src
+      https://github.com/pmqs/Compress-Raw-Bzip2/pull/7
+      8728d405e8d805cb88685b82a5e5493b62288046
+
   2.201 25 June 2022
 
       * 2.201

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/META.json -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/META.json Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/META.yml -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/META.yml Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/README -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/README Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/blocksort.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/blocksort.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -27,11 +27,11 @@
 /*---------------------------------------------*/
 
 /*---------------------------------------------*/
-static 
+static
 __inline__
-void fallbackSimpleSort ( UInt32* fmap, 
-                          UInt32* eclass, 
-                          Int32   lo, 
+void fallbackSimpleSort ( UInt32* fmap,
+                          UInt32* eclass,
+                          Int32   lo,
                           Int32   hi )
 {
    Int32 i, j, tmp;
@@ -90,9 +90,9 @@
 
 
 static
-void fallbackQSort3 ( UInt32* fmap, 
+void fallbackQSort3 ( UInt32* fmap,
                       UInt32* eclass,
-                      Int32   loSt, 
+                      Int32   loSt,
                       Int32   hiSt )
 {
    Int32 unLo, unHi, ltLo, gtHi, n, m;
@@ -117,9 +117,9 @@
       }
 
       /* Random partitioning.  Median of 3 sometimes fails to
-         avoid bad cases.  Median of 9 seems to help but 
+         avoid bad cases.  Median of 9 seems to help but
          looks rather expensive.  This too seems to work but
-         is cheaper.  Guidance for the magic constants 
+         is cheaper.  Guidance for the magic constants
          7621 and 32768 is taken from Sedgewick's algorithms
          book, chapter 35.
       */
@@ -136,10 +136,10 @@
          while (1) {
             if (unLo > unHi) break;
             n = (Int32)eclassfmapunLo - (Int32)med;
-            if (n == 0) { 
-               fswap(fmapunLo, fmapltLo); 
-               ltLo++; unLo++; 
-               continue; 
+            if (n == 0) {
+               fswap(fmapunLo, fmapltLo);
+               ltLo++; unLo++;
+               continue;
             };
             if (n > 0) break;
             unLo++;
@@ -147,10 +147,10 @@
          while (1) {
             if (unLo > unHi) break;
             n = (Int32)eclassfmapunHi - (Int32)med;
-            if (n == 0) { 
-               fswap(fmapunHi, fmapgtHi); 
-               gtHi--; unHi--; 
-               continue; 
+            if (n == 0) {
+               fswap(fmapunHi, fmapgtHi);
+               gtHi--; unHi--;
+               continue;
             };
             if (n < 0) break;
             unHi--;
@@ -209,8 +209,8 @@
 #define UNALIGNED_BH(zz)  ((zz) & 0x01f)
 
 static
-void fallbackSort ( UInt32* fmap, 
-                    UInt32* eclass, 
+void fallbackSort ( UInt32* fmap,
+                    UInt32* eclass,
                     UInt32* bhtab,
                     Int32   nblock,
                     Int32   verb )
@@ -251,7 +251,7 @@
    --*/
 
    /*-- set sentinel bits for block-end detection --*/
-   for (i = 0; i < 32; i++) { 
+   for (i = 0; i < 32; i++) {
       SET_BH(nblock + 2*i);
       CLEAR_BH(nblock + 2*i + 1);
    }
@@ -260,7 +260,7 @@
    H = 1;
    while (1) {
 
-      if (verb >= 4) 
+      if (verb >= 4)
          VPrintf1 ( "        depth %6d has ", H );
 
       j = 0;
@@ -305,14 +305,14 @@
          }
       }
 
-      if (verb >= 4) 
+      if (verb >= 4)
          VPrintf1 ( "%6d unresolved strings\n", nNotDone );
 
       H *= 2;
       if (H > nblock || nNotDone == 0) break;
    }
 
-   /*-- 
+   /*--
       Reconstruct the original block in
       eclass8 0 .. nblock-1, since the
       previous phase destroyed it.
@@ -344,9 +344,9 @@
 /*---------------------------------------------*/
 static
 __inline__
-Bool mainGtU ( UInt32  i1, 
+Bool mainGtU ( UInt32  i1,
                UInt32  i2,
-               UChar*  block, 
+               UChar*  block,
                UInt16* quadrant,
                UInt32  nblock,
                Int32*  budget )
@@ -486,8 +486,8 @@
                       UChar*  block,
                       UInt16* quadrant,
                       Int32   nblock,
-                      Int32   lo, 
-                      Int32   hi, 
+                      Int32   lo,
+                      Int32   hi,
                       Int32   d,
                       Int32*  budget )
 {
@@ -511,8 +511,8 @@
          if (i > hi) break;
          v = ptri;
          j = i;
-         while ( mainGtU ( 
-                    ptrj-h+d, v+d, block, quadrant, nblock, budget 
+         while ( mainGtU (
+                    ptrj-h+d, v+d, block, quadrant, nblock, budget
                  ) ) {
             ptrj = ptrj-h;
             j = j - h;
@@ -525,8 +525,8 @@
          if (i > hi) break;
          v = ptri;
          j = i;
-         while ( mainGtU ( 
-                    ptrj-h+d, v+d, block, quadrant, nblock, budget 
+         while ( mainGtU (
+                    ptrj-h+d, v+d, block, quadrant, nblock, budget
                  ) ) {
             ptrj = ptrj-h;
             j = j - h;
@@ -539,8 +539,8 @@
          if (i > hi) break;
          v = ptri;
          j = i;
-         while ( mainGtU ( 
-                    ptrj-h+d, v+d, block, quadrant, nblock, budget 
+         while ( mainGtU (
+                    ptrj-h+d, v+d, block, quadrant, nblock, budget
                  ) ) {
             ptrj = ptrj-h;
             j = j - h;
@@ -578,13 +578,13 @@
    }                                  \
 }
 
-static 
+static
 __inline__
 UChar mmed3 ( UChar a, UChar b, UChar c )
 {
    UChar t;
    if (a > b) { t = a; a = b; b = t; };
-   if (b > c) { 
+   if (b > c) {
       b = c;
       if (a > b) b = a;
    }
@@ -622,8 +622,8 @@
                   UChar*  block,
                   UInt16* quadrant,

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/bzlib.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/bzlib.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -40,7 +40,7 @@
 #ifndef BZ_NO_STDIO
 void BZ2_bz__AssertH__fail ( int errcode )
 {
-   fprintf(stderr, 
+   fprintf(stderr,
       "\n\nbzip2/libbzip2: internal error number %d.\n"
       "This is a bug in bzip2/libbzip2, %s.\n"
       "Please report it to: bzip2-devel@sourceware.org.  If this happened\n"
@@ -103,7 +103,7 @@
 {
    void* v = malloc ( items * size );
    ((void)opaque); /* Silence unused parameter warning */
-   
+
    return v;
 }
 
@@ -149,8 +149,8 @@
 
 
 /*---------------------------------------------------*/
-int BZ_API(BZ2_bzCompressInit) 
-                    ( bz_stream* strm, 
+int BZ_API(BZ2_bzCompressInit)
+                    ( bz_stream* strm,
                      int        blockSize100k,
                      int        verbosity,
                      int        workFactor )
@@ -160,7 +160,7 @@
 
    if (!bz_config_ok()) return BZ_CONFIG_ERROR;
 
-   if (strm == NULL || 
+   if (strm == NULL ||
        blockSize100k < 1 || blockSize100k > 9 ||
        workFactor < 0 || workFactor > 250)
      return BZ_PARAM_ERROR;
@@ -303,7 +303,7 @@
          /*-- no input? --*/
          if (s->strm->avail_in == 0) break;
          progress_in = True;
-         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
+         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
          s->strm->next_in++;
          s->strm->avail_in--;
          s->strm->total_in_lo32++;
@@ -321,7 +321,7 @@
          /*-- flush/finish end? --*/
          if (s->avail_in_expect == 0) break;
          progress_in = True;
-         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) ); 
+         ADD_CHAR_TO_BLOCK ( s, (UInt32)(*((UChar*)(s->strm->next_in))) );
          s->strm->next_in++;
          s->strm->avail_in--;
          s->strm->total_in_lo32++;
@@ -367,18 +367,18 @@
    Bool progress_in  = False;
    Bool progress_out = False;
    EState* s = (EState*) strm->state;
-   
+
    while (True) {
 
       if (s->state == BZ_S_OUTPUT) {
          progress_out |= copy_output_until_stop ( s );
          if (s->state_out_pos < s->numZ) break;
-         if (s->mode == BZ_M_FINISHING && 
+         if (s->mode == BZ_M_FINISHING &&
              s->avail_in_expect == 0 &&
              isempty_RL(s)) break;
          prepare_new_block ( s );
          s->state = BZ_S_INPUT;
-         if (s->mode == BZ_M_FLUSHING && 
+         if (s->mode == BZ_M_FLUSHING &&
              s->avail_in_expect == 0 &&
              isempty_RL(s)) break;
       }
@@ -427,7 +427,7 @@
          if (action == BZ_RUN) {
             progress = handle_compress ( strm );
             return progress ? BZ_RUN_OK : BZ_PARAM_ERROR;
-         } 
+         }
          else
 	 if (action == BZ_FLUSH) {
             s->avail_in_expect = strm->avail_in;
@@ -440,12 +440,12 @@
             s->mode = BZ_M_FINISHING;
             goto preswitch;
          }
-         else 
+         else
             return BZ_PARAM_ERROR;
 
       case BZ_M_FLUSHING:
          if (action != BZ_FLUSH) return BZ_SEQUENCE_ERROR;
-         if (s->avail_in_expect != s->strm->avail_in) 
+         if (s->avail_in_expect != s->strm->avail_in)
             return BZ_SEQUENCE_ERROR;
          progress = handle_compress ( strm );
          if (s->avail_in_expect > 0 || !isempty_RL(s) ||
@@ -455,7 +455,7 @@
 
       case BZ_M_FINISHING:
          if (action != BZ_FINISH) return BZ_SEQUENCE_ERROR;
-         if (s->avail_in_expect != s->strm->avail_in) 
+         if (s->avail_in_expect != s->strm->avail_in)
             return BZ_SEQUENCE_ERROR;
          progress = handle_compress ( strm );
          if (!progress) return BZ_SEQUENCE_ERROR;
@@ -482,7 +482,7 @@
    if (s->ftab != NULL) BZFREE(s->ftab);
    BZFREE(strm->state);
 
-   strm->state = NULL;   
+   strm->state = NULL;
 
    return BZ_OK;
 }
@@ -493,8 +493,8 @@
 /*---------------------------------------------------*/
 
 /*---------------------------------------------------*/
-int BZ_API(BZ2_bzDecompressInit) 
-                     ( bz_stream* strm, 
+int BZ_API(BZ2_bzDecompressInit)
+                     ( bz_stream* strm,
                        int        verbosity,
                        int        small )
 {
@@ -559,34 +559,34 @@
 
          /* can a new run be started? */
          if (s->nblock_used == s->save_nblock+1) return False;
-               
+
          /* Only caused by corrupt data stream? */
          if (s->nblock_used > s->save_nblock+1)
             return True;
-   
+
          s->state_out_len = 1;
          s->state_out_ch = s->k0;
-         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
          k1 ^= BZ_RAND_MASK; s->nblock_used++;
          if (s->nblock_used == s->save_nblock+1) continue;
          if (k1 != s->k0) { s->k0 = k1; continue; };
-   
+
          s->state_out_len = 2;
-         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
          k1 ^= BZ_RAND_MASK; s->nblock_used++;
          if (s->nblock_used == s->save_nblock+1) continue;
          if (k1 != s->k0) { s->k0 = k1; continue; };
-   
+
          s->state_out_len = 3;
-         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
          k1 ^= BZ_RAND_MASK; s->nblock_used++;
          if (s->nblock_used == s->save_nblock+1) continue;
          if (k1 != s->k0) { s->k0 = k1; continue; };
-   
-         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK; 
+
+         BZ_GET_FAST(k1); BZ_RAND_UPD_MASK;
          k1 ^= BZ_RAND_MASK; s->nblock_used++;
          s->state_out_len = ((Int32)k1) + 4;
-         BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK; 
+         BZ_GET_FAST(s->k0); BZ_RAND_UPD_MASK;
          s->k0 ^= BZ_RAND_MASK; s->nblock_used++;
       }
 
@@ -624,7 +624,7 @@
             }
             s_state_out_len_eq_one:
             {
-               if (cs_avail_out == 0) { 
+               if (cs_avail_out == 0) {
                   c_state_out_len = 1; goto return_notr;
                };
                *( (UChar*)(cs_next_out) ) = c_state_out_ch;
@@ -632,7 +632,7 @@
                cs_next_out++;
                cs_avail_out--;
             }
-         }   
+         }

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/compress.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/compress.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -22,12 +22,18 @@
 /* CHANGES
     0.9.0    -- original version.
     0.9.0a/b -- no changes in this file.
-    0.9.0c   -- changed setting of nGroups in sendMTFValues() 
+    0.9.0c   -- changed setting of nGroups in sendMTFValues()
                 so as to do a bit better on small files
 */
 
 #include "bzlib_private.h"
 
+/*
+  Perl-specific change to allow building with C++
+  The 'register' keyword not allowed from C++17
+  see https://github.com/pmqs/Compress-Raw-Bzip2/issues/11
+*/
+#define register
 
 /*---------------------------------------------------*/
 /*--- Bit stream I/O                              ---*/
@@ -125,11 +131,11 @@
    Int32   wr;
    Int32   EOB;
 
-   /* 
+   /*
       After sorting (eg, here),
          s->arr1  0 .. s->nblock-1  holds sorted order,
          and
-         ((UChar*)s->arr2)  0 .. s->nblock-1  
+         ((UChar*)s->arr2)  0 .. s->nblock-1 
          holds the original block data.
 
       The first thing to do is generate the MTF values,
@@ -144,7 +150,7 @@
          (UChar*) (&((UChar*)s->arr2)s->nblock)
 
       These storage aliases are set up in bzCompressInit(),
-      except for the last one, which is arranged in 
+      except for the last one, which is arranged in
       compressBlock().
    */
    UInt32* ptr   = s->ptr;
@@ -167,7 +173,7 @@
       ll_i = s->unseqToSeqblockj;
       AssertD ( ll_i < s->nInUse, "generateMTFValues(2a)" );
 
-      if (yy0 == ll_i) { 
+      if (yy0 == ll_i) {
          zPend++;
       } else {
 
@@ -175,11 +181,11 @@
             zPend--;
             while (True) {
                if (zPend & 1) {
-                  mtfvwr = BZ_RUNB; wr++; 
-                  s->mtfFreqBZ_RUNB++; 
+                  mtfvwr = BZ_RUNB; wr++;
+                  s->mtfFreqBZ_RUNB++;
                } else {
-                  mtfvwr = BZ_RUNA; wr++; 
-                  s->mtfFreqBZ_RUNA++; 
+                  mtfvwr = BZ_RUNA; wr++;
+                  s->mtfFreqBZ_RUNA++;
                }
                if (zPend < 2) break;
                zPend = (zPend - 2) / 2;
@@ -213,11 +219,11 @@
       zPend--;
       while (True) {
          if (zPend & 1) {
-            mtfvwr = BZ_RUNB; wr++; 
-            s->mtfFreqBZ_RUNB++; 
+            mtfvwr = BZ_RUNB; wr++;
+            s->mtfFreqBZ_RUNB++;
          } else {
-            mtfvwr = BZ_RUNA; wr++; 
-            s->mtfFreqBZ_RUNA++; 
+            mtfvwr = BZ_RUNA; wr++;
+            s->mtfFreqBZ_RUNA++;
          }
          if (zPend < 2) break;
          zPend = (zPend - 2) / 2;
@@ -240,7 +246,8 @@
 {
    Int32 v, t, i, j, gs, ge, totc, bt, bc, iter;
    Int32 nSelectors, alphaSize, minLen, maxLen, selCtr;
-   Int32 nGroups, nBytes;
+   Int32 nGroups;
+   Int32 nBytes = 0;
 
    /*--
    UChar  len BZ_N_GROUPSBZ_MAX_ALPHA_SIZE;
@@ -261,7 +268,7 @@
    ((void)nBytes); /* Silence variable ‘nBytes’ set but not used warning */
    if (s->verbosity >= 3)
       VPrintf3( "      %d in block, %d after MTF & 1-2 coding, "
-                "%d+2 syms in use\n", 
+                "%d+2 syms in use\n",
                 s->nblock, s->nMTF, s->nInUse );
 
    alphaSize = s->nInUse+2;
@@ -278,7 +285,7 @@
                        nGroups = 6;
 
    /*--- Generate an initial set of coding tables ---*/
-   { 
+   {
       Int32 nPart, remF, tFreq, aFreq;
 
       nPart = nGroups;
@@ -293,8 +300,8 @@
             aFreq += s->mtfFreqge;
          }
 
-         if (ge > gs 
-             && nPart != nGroups && nPart != 1 
+         if (ge > gs
+             && nPart != nGroups && nPart != 1
              && ((nGroups-nPart) % 2 == 1)) {
             aFreq -= s->mtfFreqge;
             ge--;
@@ -303,21 +310,21 @@
          if (s->verbosity >= 3)
             VPrintf5( "      initial group %d, %d .. %d, "
                       "has %d syms (%4.1f%%)\n",
-                      nPart, gs, ge, aFreq, 
+                      nPart, gs, ge, aFreq,
                       (100.0 * (float)aFreq) / (float)(s->nMTF) );
- 
+
          for (v = 0; v < alphaSize; v++)
-            if (v >= gs && v <= ge) 
+            if (v >= gs && v <= ge)
                s->lennPart-1v = BZ_LESSER_ICOST; else
                s->lennPart-1v = BZ_GREATER_ICOST;
- 
+
          nPart--;
          gs = ge+1;
          remF -= aFreq;
       }
    }
 
-   /*--- 
+   /*---
       Iterate up to BZ_N_ITERS times to improve the tables.
    ---*/
    for (iter = 0; iter < BZ_N_ITERS; iter++) {
@@ -330,7 +337,7 @@
 
       /*---
         Set up an auxiliary length table which is used to fast-track
-	the common case (nGroups == 6). 
+	the common case (nGroups == 6).
       ---*/
       if (nGroups == 6) {
          for (v = 0; v < alphaSize; v++) {
@@ -347,10 +354,10 @@
 
          /*--- Set group start & end marks. --*/
          if (gs >= s->nMTF) break;
-         ge = gs + BZ_G_SIZE - 1; 
+         ge = gs + BZ_G_SIZE - 1;
          if (ge >= s->nMTF) ge = s->nMTF-1;
 
-         /*-- 
+         /*--
             Calculate the cost of this group as coded
             by each of the coding tables.
          --*/
@@ -387,13 +394,13 @@
 
          } else {
 	    /*--- slow version which correctly handles all situations ---*/
-            for (i = gs; i <= ge; i++) { 
+            for (i = gs; i <= ge; i++) {
                UInt16 icv = mtfvi;
                for (t = 0; t < nGroups; t++) costt += s->lenticv;
             }
          }
- 
-         /*-- 
+
+         /*--
             Find the coding table which is best for this group,
             and record its identity in the selector table.
          --*/
@@ -405,7 +412,7 @@
          s->selectornSelectors = bt;

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/crctable.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/crctable.c Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/decompress.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/decompress.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -128,7 +128,7 @@
    Int32  N;
    Int32  curr;
    Int32  zt;
-   Int32  zn; 
+   Int32  zn;
    Int32  zvec;
    Int32  zj;
    Int32  gSel;
@@ -182,7 +182,7 @@
    N           = s->save_N;
    curr        = s->save_curr;
    zt          = s->save_zt;
-   zn          = s->save_zn; 
+   zn          = s->save_zn;
    zvec        = s->save_zvec;
    zj          = s->save_zj;
    gSel        = s->save_gSel;
@@ -205,14 +205,14 @@
       if (uc != BZ_HDR_h) RETURN(BZ_DATA_ERROR_MAGIC);
 
       GET_BITS(BZ_X_MAGIC_4, s->blockSize100k, 8)
-      if (s->blockSize100k < (BZ_HDR_0 + 1) || 
+      if (s->blockSize100k < (BZ_HDR_0 + 1) ||
           s->blockSize100k > (BZ_HDR_0 + 9)) RETURN(BZ_DATA_ERROR_MAGIC);
       s->blockSize100k -= BZ_HDR_0;
 
       if (s->smallDecompress) {
          s->ll16 = (UInt16*) BZALLOC( s->blockSize100k * 100000 * sizeof(UInt16) );
-         s->ll4  = (UChar*) BZALLOC( 
-                      ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar) 
+         s->ll4  = (UChar*) BZALLOC(
+                      ((1 + s->blockSize100k * 100000) >> 1) * sizeof(UChar)
                    );
          if (s->ll16 == NULL || s->ll4 == NULL) RETURN(BZ_MEM_ERROR);
       } else {
@@ -238,7 +238,7 @@
       s->currBlockNo++;
       if (s->verbosity >= 2)
          VPrintf1 ( "\n    %d: huff+mtf ", s->currBlockNo );
- 
+
       s->storedBlockCRC = 0;
       GET_UCHAR(BZ_X_BCRC_1, uc);
       s->storedBlockCRC = (s->storedBlockCRC << 8) | ((UInt32)uc);
@@ -261,14 +261,14 @@
 
       if (s->origPtr < 0)
          RETURN(BZ_DATA_ERROR);
-      if (s->origPtr > 10 + 100000*s->blockSize100k) 
+      if (s->origPtr > 10 + 100000*s->blockSize100k)
          RETURN(BZ_DATA_ERROR);
 
       /*--- Receive the mapping table ---*/
       for (i = 0; i < 16; i++) {
          GET_BIT(BZ_X_MAPPING_1, uc);
-         if (uc == 1) 
-            s->inUse16i = True; else 
+         if (uc == 1)
+            s->inUse16i = True; else
             s->inUse16i = False;
       }
 
@@ -310,7 +310,7 @@
       {
          UChar posBZ_N_GROUPS, tmp, v;
          for (v = 0; v < nGroups; v++) posv = v;
-   
+
          for (i = 0; i < nSelectors; i++) {
             v = s->selectorMtfi;
             tmp = posv;
@@ -343,10 +343,10 @@
             if (s->lenti > maxLen) maxLen = s->lenti;
             if (s->lenti < minLen) minLen = s->lenti;
          }
-         BZ2_hbCreateDecodeTables ( 
-            &(s->limitt0), 
-            &(s->baset0), 
-            &(s->permt0), 
+         BZ2_hbCreateDecodeTables (
+            &(s->limitt0),
+            &(s->baset0),
+            &(s->permt0),
             &(s->lent0),
             minLen, maxLen, alphaSize
          );
@@ -445,23 +445,23 @@
                      s->mtfa(z)-3 = s->mtfa(z)-4;
                      nn -= 4;
                   }
-                  while (nn > 0) { 
-                     s->mtfa(pp+nn) = s->mtfa(pp+nn)-1; nn--; 
+                  while (nn > 0) {
+                     s->mtfa(pp+nn) = s->mtfa(pp+nn)-1; nn--;
                   };
                   s->mtfapp = uc;
-               } else { 
+               } else {
                   /* general case */
                   lno = nn / MTFL_SIZE;
                   off = nn % MTFL_SIZE;
                   pp = s->mtfbaselno + off;
                   uc = s->mtfapp;
-                  while (pp > s->mtfbaselno) { 
-                     s->mtfapp = s->mtfapp-1; pp--; 
+                  while (pp > s->mtfbaselno) {
+                     s->mtfapp = s->mtfapp-1; pp--;
                   };
                   s->mtfbaselno++;
                   while (lno > 0) {
                      s->mtfbaselno--;
-                     s->mtfas->mtfbaselno 
+                     s->mtfas->mtfbaselno
                         = s->mtfas->mtfbaselno-1 + MTFL_SIZE - 1;
                      lno--;
                   }
@@ -556,7 +556,7 @@
          if (s->blockRandomised) {
             BZ_RAND_INIT_MASK;
             BZ_GET_SMALL(s->k0); s->nblock_used++;
-            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; 
+            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
          } else {
             BZ_GET_SMALL(s->k0); s->nblock_used++;
          }
@@ -575,7 +575,7 @@
          if (s->blockRandomised) {
             BZ_RAND_INIT_MASK;
             BZ_GET_FAST(s->k0); s->nblock_used++;
-            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK; 
+            BZ_RAND_UPD_MASK; s->k0 ^= BZ_RAND_MASK;
          } else {
             BZ_GET_FAST(s->k0); s->nblock_used++;
          }
@@ -644,7 +644,7 @@
    s->save_gBase       = gBase;
    s->save_gPerm       = gPerm;
 
-   return retVal;   
+   return retVal;
 }

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/huffman.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/huffman.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -60,7 +60,7 @@
 
 
 /*---------------------------------------------------*/
-void BZ2_hbMakeCodeLengths ( UChar *len, 
+void BZ2_hbMakeCodeLengths ( UChar *len,
                              Int32 *freq,
                              Int32 alphaSize,
                              Int32 maxLen )
@@ -74,7 +74,7 @@
 
    Int32 heap    BZ_MAX_ALPHA_SIZE + 2 ;
    Int32 weight  BZ_MAX_ALPHA_SIZE * 2 ;
-   Int32 parent  BZ_MAX_ALPHA_SIZE * 2 ; 
+   Int32 parent  BZ_MAX_ALPHA_SIZE * 2 ;
 
    for (i = 0; i < alphaSize; i++)
       weighti+1 = (freqi == 0 ? 1 : freqi) << 8;
@@ -96,7 +96,7 @@
       }
 
       AssertH( nHeap < (BZ_MAX_ALPHA_SIZE+2), 2001 );
-   
+
       while (nHeap > 1) {
          n1 = heap1; heap1 = heapnHeap; nHeap--; DOWNHEAP(1);
          n2 = heap1; heap1 = heapnHeap; nHeap--; DOWNHEAP(1);
@@ -119,7 +119,7 @@
          leni-1 = j;
          if (j > maxLen) tooLong = True;
       }
-      
+
       if (! tooLong) break;
 
       /* 17 Oct 04: keep-going condition for the following loop used

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/bzip2-src/randtable.c -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/bzip2-src/randtable.c Changed

@@ -11,7 +11,7 @@
    bzip2/libbzip2 version 1.0.8 of 13 July 2019
    Copyright (C) 1996-2019 Julian Seward <jseward@acm.org>
 
-   Please read the WARNING, DISCLAIMER and PATENTS sections in the 
+   Please read the WARNING, DISCLAIMER and PATENTS sections in the
    README file.
 
    This program is released under the terms of the license contained
@@ -23,58 +23,58 @@
 
 
 /*---------------------------------------------*/
-const Int32 BZ2_rNums512 = { 
-   619, 720, 127, 481, 931, 816, 813, 233, 566, 247, 
-   985, 724, 205, 454, 863, 491, 741, 242, 949, 214, 
-   733, 859, 335, 708, 621, 574, 73, 654, 730, 472, 
-   419, 436, 278, 496, 867, 210, 399, 680, 480, 51, 
-   878, 465, 811, 169, 869, 675, 611, 697, 867, 561, 
-   862, 687, 507, 283, 482, 129, 807, 591, 733, 623, 
-   150, 238, 59, 379, 684, 877, 625, 169, 643, 105, 
-   170, 607, 520, 932, 727, 476, 693, 425, 174, 647, 
-   73, 122, 335, 530, 442, 853, 695, 249, 445, 515, 
-   909, 545, 703, 919, 874, 474, 882, 500, 594, 612, 
-   641, 801, 220, 162, 819, 984, 589, 513, 495, 799, 
-   161, 604, 958, 533, 221, 400, 386, 867, 600, 782, 
-   382, 596, 414, 171, 516, 375, 682, 485, 911, 276, 
-   98, 553, 163, 354, 666, 933, 424, 341, 533, 870, 
-   227, 730, 475, 186, 263, 647, 537, 686, 600, 224, 
-   469, 68, 770, 919, 190, 373, 294, 822, 808, 206, 
-   184, 943, 795, 384, 383, 461, 404, 758, 839, 887, 
-   715, 67, 618, 276, 204, 918, 873, 777, 604, 560, 
-   951, 160, 578, 722, 79, 804, 96, 409, 713, 940, 
-   652, 934, 970, 447, 318, 353, 859, 672, 112, 785, 
-   645, 863, 803, 350, 139, 93, 354, 99, 820, 908, 
-   609, 772, 154, 274, 580, 184, 79, 626, 630, 742, 
-   653, 282, 762, 623, 680, 81, 927, 626, 789, 125, 
-   411, 521, 938, 300, 821, 78, 343, 175, 128, 250, 
-   170, 774, 972, 275, 999, 639, 495, 78, 352, 126, 
-   857, 956, 358, 619, 580, 124, 737, 594, 701, 612, 
-   669, 112, 134, 694, 363, 992, 809, 743, 168, 974, 
-   944, 375, 748, 52, 600, 747, 642, 182, 862, 81, 
-   344, 805, 988, 739, 511, 655, 814, 334, 249, 515, 
-   897, 955, 664, 981, 649, 113, 974, 459, 893, 228, 
-   433, 837, 553, 268, 926, 240, 102, 654, 459, 51, 
-   686, 754, 806, 760, 493, 403, 415, 394, 687, 700, 
-   946, 670, 656, 610, 738, 392, 760, 799, 887, 653, 
-   978, 321, 576, 617, 626, 502, 894, 679, 243, 440, 
-   680, 879, 194, 572, 640, 724, 926, 56, 204, 700, 
-   707, 151, 457, 449, 797, 195, 791, 558, 945, 679, 
-   297, 59, 87, 824, 713, 663, 412, 693, 342, 606, 
-   134, 108, 571, 364, 631, 212, 174, 643, 304, 329, 
-   343, 97, 430, 751, 497, 314, 983, 374, 822, 928, 
-   140, 206, 73, 263, 980, 736, 876, 478, 430, 305, 
-   170, 514, 364, 692, 829, 82, 855, 953, 676, 246, 
-   369, 970, 294, 750, 807, 827, 150, 790, 288, 923, 
-   804, 378, 215, 828, 592, 281, 565, 555, 710, 82, 
-   896, 831, 547, 261, 524, 462, 293, 465, 502, 56, 
-   661, 821, 976, 991, 658, 869, 905, 758, 745, 193, 
-   768, 550, 608, 933, 378, 286, 215, 979, 792, 961, 
-   61, 688, 793, 644, 986, 403, 106, 366, 905, 644, 
-   372, 567, 466, 434, 645, 210, 389, 550, 919, 135, 
-   780, 773, 635, 389, 707, 100, 626, 958, 165, 504, 
-   920, 176, 193, 713, 857, 265, 203, 50, 668, 108, 
-   645, 990, 626, 197, 510, 357, 358, 850, 858, 364, 
+const Int32 BZ2_rNums512 = {
+   619, 720, 127, 481, 931, 816, 813, 233, 566, 247,
+   985, 724, 205, 454, 863, 491, 741, 242, 949, 214,
+   733, 859, 335, 708, 621, 574, 73, 654, 730, 472,
+   419, 436, 278, 496, 867, 210, 399, 680, 480, 51,
+   878, 465, 811, 169, 869, 675, 611, 697, 867, 561,
+   862, 687, 507, 283, 482, 129, 807, 591, 733, 623,
+   150, 238, 59, 379, 684, 877, 625, 169, 643, 105,
+   170, 607, 520, 932, 727, 476, 693, 425, 174, 647,
+   73, 122, 335, 530, 442, 853, 695, 249, 445, 515,
+   909, 545, 703, 919, 874, 474, 882, 500, 594, 612,
+   641, 801, 220, 162, 819, 984, 589, 513, 495, 799,
+   161, 604, 958, 533, 221, 400, 386, 867, 600, 782,
+   382, 596, 414, 171, 516, 375, 682, 485, 911, 276,
+   98, 553, 163, 354, 666, 933, 424, 341, 533, 870,
+   227, 730, 475, 186, 263, 647, 537, 686, 600, 224,
+   469, 68, 770, 919, 190, 373, 294, 822, 808, 206,
+   184, 943, 795, 384, 383, 461, 404, 758, 839, 887,
+   715, 67, 618, 276, 204, 918, 873, 777, 604, 560,
+   951, 160, 578, 722, 79, 804, 96, 409, 713, 940,
+   652, 934, 970, 447, 318, 353, 859, 672, 112, 785,
+   645, 863, 803, 350, 139, 93, 354, 99, 820, 908,
+   609, 772, 154, 274, 580, 184, 79, 626, 630, 742,
+   653, 282, 762, 623, 680, 81, 927, 626, 789, 125,
+   411, 521, 938, 300, 821, 78, 343, 175, 128, 250,
+   170, 774, 972, 275, 999, 639, 495, 78, 352, 126,
+   857, 956, 358, 619, 580, 124, 737, 594, 701, 612,
+   669, 112, 134, 694, 363, 992, 809, 743, 168, 974,
+   944, 375, 748, 52, 600, 747, 642, 182, 862, 81,
+   344, 805, 988, 739, 511, 655, 814, 334, 249, 515,
+   897, 955, 664, 981, 649, 113, 974, 459, 893, 228,
+   433, 837, 553, 268, 926, 240, 102, 654, 459, 51,
+   686, 754, 806, 760, 493, 403, 415, 394, 687, 700,
+   946, 670, 656, 610, 738, 392, 760, 799, 887, 653,
+   978, 321, 576, 617, 626, 502, 894, 679, 243, 440,
+   680, 879, 194, 572, 640, 724, 926, 56, 204, 700,
+   707, 151, 457, 449, 797, 195, 791, 558, 945, 679,
+   297, 59, 87, 824, 713, 663, 412, 693, 342, 606,
+   134, 108, 571, 364, 631, 212, 174, 643, 304, 329,
+   343, 97, 430, 751, 497, 314, 983, 374, 822, 928,
+   140, 206, 73, 263, 980, 736, 876, 478, 430, 305,
+   170, 514, 364, 692, 829, 82, 855, 953, 676, 246,
+   369, 970, 294, 750, 807, 827, 150, 790, 288, 923,
+   804, 378, 215, 828, 592, 281, 565, 555, 710, 82,
+   896, 831, 547, 261, 524, 462, 293, 465, 502, 56,
+   661, 821, 976, 991, 658, 869, 905, 758, 745, 193,
+   768, 550, 608, 933, 378, 286, 215, 979, 792, 961,
+   61, 688, 793, 644, 986, 403, 106, 366, 905, 644,
+   372, 567, 466, 434, 645, 210, 389, 550, 919, 135,
+   780, 773, 635, 389, 707, 100, 626, 958, 165, 504,
+   920, 176, 193, 713, 857, 265, 203, 50, 668, 108,
+   645, 990, 626, 197, 510, 357, 358, 850, 858, 364,
    936, 638
 };

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/lib/Compress/Raw/Bzip2.pm -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/lib/Compress/Raw/Bzip2.pm Changed

_service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/suppressions.asan Added

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/t/000prereq.t -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/t/000prereq.t Changed

_service:tar_scm:Compress-Raw-Bzip2-2.201.tar.gz/t/Test/More.pm -> _service:tar_scm:Compress-Raw-Bzip2-2.205.tar.gz/t/Test/More.pm Changed

@@ -361,7 +361,7 @@
     $Test->isnt_eq(@_);
 }
 
-*isn't = \&isnt;
+# *isn't = \&isnt;
 
 
 =item B<like>
@@ -463,9 +463,9 @@
 
 is almost exactly like saying:
 
-    ok( Foo->can('this') && 
-        Foo->can('that') && 
-        Foo->can('whatever') 
+    ok( Foo->can('this') &&
+        Foo->can('that') &&
+        Foo->can('whatever')
       );
 
 only without all the typing and with a better interface.  Handy for
@@ -498,9 +498,9 @@
     }
 
     my $name;
-    $name = @methods == 1 ? "$class->can('$methods0')" 
+    $name = @methods == 1 ? "$class->can('$methods0')"
                           : "$class->can(...)";
-    
+
     my $ok = $Test->ok( !@nok, $name );
 
     $Test->diag(map "    $class->can('$_') failed\n", @nok);
@@ -573,8 +573,8 @@
             $diag = "$obj_name isn't a '$class' it's a '$ref'";
         }
     }
-            
-      
+
+
 
     my $ok;
     if( $diag ) {
@@ -809,7 +809,7 @@
 
 Sometimes running a test under certain conditions will cause the
 test script to die.  A certain function or method isn't implemented
-(such as fork() on MacOS), some resource isn't available (like a 
+(such as fork() on MacOS), some resource isn't available (like a
 net connection) or a module isn't available.  In these cases it's
 necessary to skip tests, or declare that they are supposed to fail
 but will work in the future (a todo test).
@@ -1009,7 +1009,7 @@
     unless( @_ == 2 or @_ == 3 ) {
         my $msg = <<WARNING;
 is_deeply() takes two or three args, you gave %d.
-This usually means you passed an array or hash instead 
+This usually means you passed an array or hash instead
 of a reference to it
 WARNING
         chop $msg;   # clip off newline so carp() will put in line/file
@@ -1111,7 +1111,7 @@
 
     ok( eq_array(\@this, \@that) );
 
-C<is_deeply()> can do that better and with diagnostics.  
+C<is_deeply()> can do that better and with diagnostics.
 
     is_deeply( \@this, \@that );
 
@@ -1171,7 +1171,7 @@
 
     {
         # Quiet uninitialized value warnings when comparing undefs.
-        local $^W = 0; 
+        local $^W = 0;
 
         $Test->_unoverload(\$e1, \$e2);
 
@@ -1483,7 +1483,7 @@
 
 Copyright 2001, 2002, 2004 by Michael G Schwern E<lt>schwern@pobox.comE<gt>.
 
-This program is free software; you can redistribute it and/or 
+This program is free software; you can redistribute it and/or
 modify it under the same terms as Perl itself.
 
 See F<http://www.perl.com/perl/misc/Artistic.html>

Changes of Revision 9