File: quality.cpp

package info (click to toggle)
boost1.90 1.90.0-1
  • links: PTS, VCS
  • area: main
  • in suites:
  • size: 593,120 kB
  • sloc: cpp: 4,190,908; xml: 196,648; python: 34,618; ansic: 23,145; asm: 5,468; sh: 3,774; makefile: 1,161; perl: 1,020; sql: 728; ruby: 676; yacc: 478; java: 77; lisp: 24; csh: 6
file content (89 lines) | stat: -rw-r--r-- 2,144 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
// Copyright 2024 Peter Dimov
// Distributed under the Boost Software License, Version 1.0.
// https://www.boost.org/LICENSE_1_0.txt

#include <boost/hash2/fnv1a.hpp>
#include <boost/hash2/xxhash.hpp>
#include <boost/hash2/xxh3.hpp>
#include <boost/hash2/siphash.hpp>
#include <boost/core/lightweight_test.hpp>
#include <vector>
#include <cstddef>
#include <cstdio>

template<class H> void test_bit_flip( unsigned char ch )
{
    int const N = 32;

    std::vector<unsigned char> v( N, static_cast<unsigned char>( ch ) );

    for( int n = 1; n <= N; ++n )
    {
        typename H::result_type r1 = {};

        {
            H h;
            h.update( v.data(), n );

            r1 = h.result();
        }

        for( int j = 0; j < n * 8; ++j )
        {
            v[ j / 8 ] ^= 1 << ( j % 8 );

            H h;
            h.update( v.data(), n );

            typename H::result_type r2 = h.result();

            v[ j / 8 ] ^= 1 << ( j % 8 );

            BOOST_TEST( r1 != r2 ) || std::fprintf( stderr, "Hash collision with bit %d flipped in %d * 0x%02X\n", j, n, ch );
        }
    }
}

template<class H> void test_seq_length( unsigned char ch )
{
    int const N = 1024;

    std::vector<unsigned char> v( N, static_cast<unsigned char>( ch ) );

    typename H::result_type r[ N ] = {};

    for( int n = 0; n < N; ++n )
    {
        H h;
        h.update( v.data(), n );

        r[ n ] = h.result();

        for( int j = 0; j < n; ++j )
        {
            BOOST_TEST( r[j] != r[n] ) || std::fprintf( stderr, "Hash collision between %d * 0x%02X and %d * 0x%02X\n", j, ch, n, ch );
        }
    }
}

template<class H> void test()
{
    for( int ch = 0; ch <= 0xFF; ++ch )
    {
        test_bit_flip<H>( static_cast<unsigned char>( ch ) );
        test_seq_length<H>( static_cast<unsigned char>( ch ) );
    }
}

int main()
{
    test<boost::hash2::fnv1a_32>();
    test<boost::hash2::fnv1a_64>();
    test<boost::hash2::xxhash_32>();
    test<boost::hash2::xxhash_64>();
    test<boost::hash2::xxh3_128>();
    test<boost::hash2::siphash_32>();
    test<boost::hash2::siphash_64>();

    return boost::report_errors();
}