upstream/mercurial-mirror Files · mercurial/thirdparty/sha1dc/lib/ubc_check.h

exchange: improve computation of relevant markers for large repos...

exchange: improve computation of relevant markers for large repos Compute the candidate nodes with relevant markers directly from keys of the predecessors/successors/children dictionaries of obsstore. This is faster than iterating over all nodes directly. This test could be further improved for repositories with relative few markers compared to the repository size, but this is no longer hot already. With the current loop structure, the obshashrange use works as well as before as it passes lists with a single node. Adjust the interface by allowing revision lists as well as node lists. This helps cases that computes ancestors as it reduces the materialisation cost. Use this in _pushdiscoveryobsmarker and _getbundleobsmarkerpart. Improve the latter further by directly using ancestors(). Performance benchmarks show notable and welcome improvement to no-op push and pull (that would also apply to other push/pull). This apply to push and pull done without evolve. ### push/pull Benchmark parameter # bin-env-vars.hg.flavor = default # benchmark.variants.explicit-rev = none # benchmark.variants.protocol = ssh # benchmark.variants.revs = none ## benchmark.name = hg.command.pull # data-env-vars.name = mercurial-devel-2024-03-22-zstd-sparse-revlog before: 5.968537 seconds after: 5.668507 seconds (-5.03%, -0.30) # data-env-vars.name = tryton-devel-2024-03-22-zstd-sparse-revlog before: 1.446232 seconds after: 0.835553 seconds (-42.23%, -0.61) # data-env-vars.name = netbsd-src-draft-2024-09-19-zstd-sparse-revlog before: 5.777412 seconds after: 2.523454 seconds (-56.32%, -3.25) ## benchmark.name = hg.command.push # data-env-vars.name = mercurial-devel-2024-03-22-zstd-sparse-revlog before: 6.155501 seconds after: 5.885072 seconds (-4.39%, -0.27) # data-env-vars.name = tryton-devel-2024-03-22-zstd-sparse-revlog before: 1.491054 seconds after: 0.934882 seconds (-37.30%, -0.56) # data-env-vars.name = netbsd-src-draft-2024-09-19-zstd-sparse-revlog before: 5.902494 seconds after: 2.957644 seconds (-49.89%, -2.94) There is not notable different in these result using the "rust" flavor instead of the "default". The performance impact on the same operation when using evolve were also tested and no impact was noted.

Matt Harbison - - Load All Authors

File last commit:

r44558:b4420cea default


                r52789:8583d138

default

Download file

             ubc_check.h
        
                    57 lines
            
             | 1.8 KiB
            
                | text/x-c
            
             |
                CLexer
            
             / mercurial / thirdparty / sha1dc / lib / ubc_check.h
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      /***

      * Copyright 2017 Marc Stevens <marc@marc-stevens.nl>, Dan Shumow <danshu@microsoft.com>

      * Distributed under the MIT Software License.

      * See accompanying file LICENSE.txt or copy at

      * https://opensource.org/licenses/MIT

      ***/

      /*

      // this file was generated by the 'parse_bitrel' program in the tools section

      // using the data files from directory 'tools/data/3565'

      //

      // sha1_dvs contains a list of SHA-1 Disturbance Vectors (DV) to check

      // dvType, dvK and dvB define the DV: I(K,B) or II(K,B) (see the paper)

      // dm[80] is the expanded message block XOR-difference defined by the DV

      // testt is the step to do the recompression from for collision detection

      // maski and maskb define the bit to check for each DV in the dvmask returned by ubc_check

      //

      // ubc_check takes as input an expanded message block and verifies the unavoidable bitconditions for all listed DVs

      // it returns a dvmask where each bit belonging to a DV is set if all unavoidable bitconditions for that DV have been met

      // thus one needs to do the recompression check for each DV that has its bit set

      */

      #ifndef SHA1DC_UBC_CHECK_H

      #define SHA1DC_UBC_CHECK_H

      #if defined(__cplusplus)

      extern "C" {

      #endif

      #ifndef SHA1DC_NO_STANDARD_INCLUDES

      #if !defined(_MSC_VER) || _MSC_VER >= 1600

      #include <stdint.h>

      #else

      /* prior to Visual Studio 2010 */

      typedef unsigned __int32 uint32_t;

      #endif

      #endif

      #define DVMASKSIZE 1

      typedef struct { int dvType; int dvK; int dvB; int testt; int maski; int maskb; uint32_t dm[80]; } dv_info_t;

      extern dv_info_t sha1_dvs[];

      void ubc_check(const uint32_t W[80], uint32_t dvmask[DVMASKSIZE]);

      #define DOSTORESTATE58

      #define DOSTORESTATE65

      #define CHECK_DVMASK(_DVMASK) (0 != _DVMASK[0])

      #if defined(__cplusplus)

      }

      #endif

      #ifdef SHA1DC_CUSTOM_TRAILING_INCLUDE_UBC_CHECK_H

      #include SHA1DC_CUSTOM_TRAILING_INCLUDE_UBC_CHECK_H

      #endif

      #endif

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				/***
				* Copyright 2017 Marc Stevens <marc@marc-stevens.nl>, Dan Shumow <danshu@microsoft.com>
				* Distributed under the MIT Software License.
				* See accompanying file LICENSE.txt or copy at
				* https://opensource.org/licenses/MIT
				***/

				/*
				// this file was generated by the 'parse_bitrel' program in the tools section
				// using the data files from directory 'tools/data/3565'
				//
				// sha1_dvs contains a list of SHA-1 Disturbance Vectors (DV) to check
				// dvType, dvK and dvB define the DV: I(K,B) or II(K,B) (see the paper)
				// dm[80] is the expanded message block XOR-difference defined by the DV
				// testt is the step to do the recompression from for collision detection
				// maski and maskb define the bit to check for each DV in the dvmask returned by ubc_check
				//
				// ubc_check takes as input an expanded message block and verifies the unavoidable bitconditions for all listed DVs
				// it returns a dvmask where each bit belonging to a DV is set if all unavoidable bitconditions for that DV have been met
				// thus one needs to do the recompression check for each DV that has its bit set
				*/

				#ifndef SHA1DC_UBC_CHECK_H
				#define SHA1DC_UBC_CHECK_H

				#if defined(__cplusplus)
				extern "C" {
				#endif

				#ifndef SHA1DC_NO_STANDARD_INCLUDES
				#if !defined(_MSC_VER) \|\| _MSC_VER >= 1600
				#include <stdint.h>
				#else
				/* prior to Visual Studio 2010 */
				typedef unsigned __int32 uint32_t;
				#endif
				#endif

				#define DVMASKSIZE 1
				typedef struct { int dvType; int dvK; int dvB; int testt; int maski; int maskb; uint32_t dm[80]; } dv_info_t;
				extern dv_info_t sha1_dvs[];
				void ubc_check(const uint32_t W[80], uint32_t dvmask[DVMASKSIZE]);

				#define DOSTORESTATE58
				#define DOSTORESTATE65

				#define CHECK_DVMASK(_DVMASK) (0 != _DVMASK[0])

				#if defined(__cplusplus)
				}
				#endif

				#ifdef SHA1DC_CUSTOM_TRAILING_INCLUDE_UBC_CHECK_H
				#include SHA1DC_CUSTOM_TRAILING_INCLUDE_UBC_CHECK_H
				#endif

				#endif