preprocessing

preprocessing/Doxyfile

@@ -0,0 +1,2494 @@
+# Doxyfile 1.8.13
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = "Sabre"
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         =
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          = "De l'Épée au Sabre for Speedier Ripostes"
+
+# With the PROJECT_LOGO tag one can specify a logo or an icon that is included
+# in the documentation. The maximum height of the logo should not exceed 55
+# pixels and the maximum width should not exceed 200 pixels. Doxygen will copy
+# the logo to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       = doc
+
+# If the CREATE_SUBDIRS tag is set to YES then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES, doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES, doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = NO
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       = "The $name class" \
+                         "The $name widget" \
+                         "The $name file" \
+                         is \
+                         provides \
+                         specifies \
+                         contains \
+                         represents \
+                         a \
+                         an \
+                         the
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = YES
+
+# If the FULL_PATH_NAMES tag is set to YES, doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES then doxygen will produce a new
+# page for each member. If set to NO, the documentation of a member will be part
+# of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note: For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When the TOC_INCLUDE_HEADINGS tag is set to a non-zero value, all headings up
+# to that level are automatically included in the table of contents, even if
+# they do not have an id attribute.
+# Note: This feature currently applies only to Markdown headings.
+# Minimum value: 0, maximum value: 99, default value: 0.
+# This tag requires that the tag MARKDOWN_SUPPORT is set to YES.
+
+TOC_INCLUDE_HEADINGS   = 0
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by putting a % sign in front of the word or
+# globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = YES
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# If one adds a struct or class to a group and this option is enabled, then also
+# any nested class or struct is added to the same group. By default this option
+# is disabled and one has to add nested compounds explicitly via \ingroup.
+# The default value is: NO.
+
+GROUP_NESTED_COMPOUNDS = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = YES
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES, doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES, all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES, all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = YES
+
+# If the EXTRACT_STATIC tag is set to YES, all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = YES
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES, classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO,
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. If set to YES, local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO, only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO, these classes will be included in the various overviews. This option
+# has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO, these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO, these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES, upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = YES
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES, the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the HIDE_COMPOUND_REFERENCE tag is set to NO (default) then doxygen will
+# append additional text to a page's title, such as Class Reference. If set to
+# YES the compound reference will be hidden.
+# The default value is: NO.
+
+HIDE_COMPOUND_REFERENCE= NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = YES
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = NO
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO, the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = YES
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable (YES) or disable (NO) the todo
+# list. This list is created by putting \todo commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable (YES) or disable (NO) the test
+# list. This list is created by putting \test commands in the documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable (YES) or disable (NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable (YES) or disable (NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES, the
+# list will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. See also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error (stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO, doxygen will only warn about wrong or incomplete
+# parameter documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = YES
+
+# If the WARN_AS_ERROR tag is set to YES then doxygen will immediately stop when
+# a warning is encountered.
+# The default value is: NO.
+
+WARN_AS_ERROR          = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces. See also FILE_PATTERNS and EXTENSION_MAPPING
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  =
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# read by doxygen.
+#
+# If left blank the following patterns are tested:*.c, *.cc, *.cxx, *.cpp,
+# *.c++, *.java, *.ii, *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h,
+# *.hh, *.hxx, *.hpp, *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc,
+# *.m, *.markdown, *.md, *.mm, *.dox, *.py, *.pyw, *.f90, *.f95, *.f03, *.f08,
+# *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf and *.qsf.
+
+FILE_PATTERNS          = *.c \
+                         *.cc \
+                         *.cxx \
+                         *.cpp \
+                         *.c++ \
+                         *.java \
+                         *.ii \
+                         *.ixx \
+                         *.ipp \
+                         *.i++ \
+                         *.inl \
+                         *.idl \
+                         *.ddl \
+                         *.odl \
+                         *.h \
+                         *.hh \
+                         *.hxx \
+                         *.hpp \
+                         *.h++ \
+                         *.cs \
+                         *.d \
+                         *.php \
+                         *.php4 \
+                         *.php5 \
+                         *.phtml \
+                         *.inc \
+                         *.m \
+                         *.markdown \
+                         *.md \
+                         *.mm \
+                         *.dox \
+                         *.py \
+                         *.pyw \
+                         *.f90 \
+                         *.f95 \
+                         *.f03 \
+                         *.f08 \
+                         *.f \
+                         *.for \
+                         *.tcl \
+                         *.vhd \
+                         *.vhdl \
+                         *.ucf \
+                         *.qsf
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = YES
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       = lowmc/constants_b*_r*_s*.h
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       = *
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+#
+# Note that for custom extensions or not directly supported extensions you also
+# need to set EXTENSION_MAPPING for the extension otherwise the files are not
+# properly processed by doxygen.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = NO
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+# If the CLANG_ASSISTED_PARSING tag is set to YES then doxygen will use the
+# clang parser (see: http://clang.llvm.org/) for more accurate parsing at the
+# cost of reduced performance. This can be particularly helpful with template
+# rich C++ code for which doxygen's built-in parser lacks the necessary type
+# information.
+# Note: The availability of this option depends on whether or not doxygen was
+# generated with the -Duse-libclang=ON option for CMake.
+# The default value is: NO.
+
+CLANG_ASSISTED_PARSING = NO
+
+# If clang assisted parsing is enabled you can provide the compiler with command
+# line options that you would normally use when invoking the compiler. Note that
+# the include paths will already be set by doxygen for the files and directories
+# specified with INPUT and INCLUDE_PATH.
+# This tag requires that the tag CLANG_ASSISTED_PARSING is set to YES.
+
+CLANG_OPTIONS          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES, doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = YES
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# cascading style sheets that are included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefore more robust against future updates.
+# Doxygen will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list). For an example see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the style sheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to YES can help to show when doxygen was last run and thus if the
+# documentation is up to date.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = NO
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler (hhc.exe). If non-empty,
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated
+# (YES) or that it should be included in the master .chm file (NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index (hhk), content (hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated
+# (YES) or a normal table of contents (NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom style sheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# If the EXT_LINKS_IN_WINDOW option is set to YES, doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using pre-rendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer (doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES, doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = YES
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES, doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. The package can be specified just
+# by its name or with the correct syntax as to be used with the LaTeX
+# \usepackage command. To get the times font for instance you can specify :
+# EXTRA_PACKAGES=times or EXTRA_PACKAGES={times}
+# To use the option intlimits with the amsmath package you can specify:
+# EXTRA_PACKAGES=[intlimits]{amsmath}
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber,
+# $projectbrief, $projectlogo. Doxygen will replace $title with the empty
+# string, for the replacement values of the other commands the user is referred
+# to HTML_HEADER.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer. See
+# LATEX_HEADER for more information on how to generate a default footer and what
+# special commands can be used inside the footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_STYLESHEET tag can be used to specify additional user-defined
+# LaTeX style sheets that are included after the standard style sheets created
+# by doxygen. Using this option one can overrule certain style aspects. Doxygen
+# will copy the style sheet files to the output directory.
+# Note: The order of the extra style sheet files is of importance (e.g. the last
+# style sheet in the list overrules the setting of the previous ones in the
+# list).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_STYLESHEET =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the USE_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES, to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+# If the LATEX_TIMESTAMP tag is set to YES then the footer of each generated
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_TIMESTAMP        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES, doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES, doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+# If the RTF_SOURCE_CODE tag is set to YES then doxygen will include source code
+# with syntax highlighting in the RTF output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_SOURCE_CODE        = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES, doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES, doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = NO
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES, doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES, doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+# If the DOCBOOK_PROGRAMLISTING tag is set to YES, doxygen will include the
+# program listings (including syntax highlighting and cross-referencing
+# information) to the DOCBOOK output. Note that enabling this will significantly
+# increase the size of the DOCBOOK output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_PROGRAMLISTING = NO
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES, doxygen will generate an
+# AutoGen Definitions (see http://autogen.sf.net) file that captures the
+# structure of the code including all documentation. Note that this feature is
+# still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES, doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES, doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES, the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO, the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES, doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES, doxygen will expand all macro names
+# in the source code. If set to NO, only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES, the include files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES, all external class will be listed in
+# the class index. If set to NO, only the inherited external classes will be
+# listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES, all external groups will be listed
+# in the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES, all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES, doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: YES.
+
+HAVE_DOT               = YES
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font in the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES, doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command. Disabling a call graph can be
+# accomplished by means of the command \hidecallgraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command. Disabling a caller graph can be
+# accomplished by means of the command \hidecallergraph.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot. For an explanation of the image formats see the section
+# output formats in the documentation of the dot tool (Graphviz (see:
+# http://www.graphviz.org/)).
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, png:cairo, png:cairo:cairo, png:cairo:gd, png:gd,
+# png:gd:gd, jpg, jpg:cairo, jpg:cairo:gd, jpg:gd, jpg:gd:gd, gif, gif:cairo,
+# gif:cairo:gd, gif:gd, gif:gd:gd, svg, png:gd, png:gd:gd, png:cairo,
+# png:cairo:gd, png:cairo:cairo, png:cairo:gdiplus, png:gdiplus and
+# png:gdiplus:gdiplus.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# When using plantuml, the PLANTUML_JAR_PATH tag should be used to specify the
+# path where java can find the plantuml.jar file. If left blank, it is assumed
+# PlantUML is not used or called during a preprocessing step. Doxygen will
+# generate a warning when it encounters a \startuml command in this case and
+# will not generate output for the diagram.
+
+PLANTUML_JAR_PATH      =
+
+# When using plantuml, the PLANTUML_CFG_FILE tag can be used to specify a
+# configuration file for plantuml.
+
+PLANTUML_CFG_FILE      =
+
+# When using plantuml, the specified paths are searched for files specified by
+# the !include statement in a plantuml block.
+
+PLANTUML_INCLUDE_PATH  =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES to allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES, doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES

preprocessing/LICENSE

@@ -0,0 +1,339 @@
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc.,
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  <signature of Ty Coon>, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.

preprocessing/Makefile

@@ -0,0 +1,37 @@
+CXX = g++
+CXXFLAGS = -g -march=native -std=c++17 -Wall -pedantic -fopenmp -O3 -Wno-ignored-attributes -pthread
+LIBS = -lbsd -lboost_system -lboost_thread -pthread
+FLAGS = -DBOOST_ERROR_CODE_HEADER_ONLY #-DDEBUG
+
+# OPENSSL_INCLUDE ?= -I/usr/include/openssl
+# CXXFLAGS += $(OPENSSL_INCLUDE)
+# OPENSSL_LIBS ?= -lcrypto
+# LIBS += $(OPENSSL_LIBS)
+
+#BINDIR = bin 
+
+all: directories preprocessing0 preprocessing1 p2preprocessing 
+ 
+preprocessing0: preprocessing.cpp block.h bitutils.h prg_aes_impl.h prg.h dpfgen.h mpc.h share-conversion.h aes.h #dpf++/dpf.h  
+	$(CXX) $(CXXFLAGS) -o preprocessing0 preprocessing.cpp $(LIBS) $(FLAGS) -DPARTY=0 -I.
+
+preprocessing1: preprocessing.cpp block.h bitutils.h prg_aes_impl.h prg.h dpfgen.h mpc.h share-conversion.h aes.h #dpf++/dpf.h  
+	$(CXX) $(CXXFLAGS) -o preprocessing1 preprocessing.cpp $(LIBS) $(FLAGS) -DPARTY=1 -I.
+
+p2preprocessing: p2preprocessing.cpp block.h bitutils.h prg_aes_impl.h prg.h dpfgen.h mpc.h share-conversion.h aes.h #dpf++/dpf.h  
+	$(CXX) $(CXXFLAGS) -o  p2preprocessing p2preprocessing.cpp $(LIBS) $(FLAGS) -I.
+
+docs:
+	doxygen Doxyfile
+
+.PHONY: directories
+
+directories: $(BINDIR)
+
+# $(BINDIR):
+# 	mkdir -p $(BINDIR)
+
+clean:
+	rm -f p2preprocessing preprocessing1 preprocessing0
+
+

preprocessing/aes.h

@@ -0,0 +1,152 @@
+/* crypto/aes/aes.h -*- mode:C; c-file-style: "eay" -*- */
+/* ====================================================================
+ * Copyright (c) 1998-2002 The OpenSSL Project.  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. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ *
+ * 3. All advertising materials mentioning features or use of this
+ *    software must display the following acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
+ *
+ * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
+ *    endorse or promote products derived from this software without
+ *    prior written permission. For written permission, please contact
+ *    openssl-core@openssl.org.
+ *
+ * 5. Products derived from this software may not be called "OpenSSL"
+ *    nor may "OpenSSL" appear in their names without prior written
+ *    permission of the OpenSSL Project.
+ *
+ * 6. Redistributions of any form whatsoever must retain the following
+ *    acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
+ * EXPRESSED 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 OpenSSL PROJECT OR
+ * ITS CONTRIBUTORS 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.
+ * ====================================================================
+ *
+ */
+
+
+#ifndef DPFPP_AES_H
+#define DPFPP_AES_H
+
+#include <x86intrin.h>
+#define EXPAND_ASSIST(v1,v2,v3,v4,shuff_const,aes_const)                    \
+    v2 = _mm_aeskeygenassist_si128(v4,aes_const);                           \
+    v3 = _mm_castps_si128(_mm_shuffle_ps(_mm_castsi128_ps(v3),              \
+                                         _mm_castsi128_ps(v1), 16));        \
+    v1 = _mm_xor_si128(v1,v3);                                              \
+    v3 = _mm_castps_si128(_mm_shuffle_ps(_mm_castsi128_ps(v3),              \
+                                         _mm_castsi128_ps(v1), 140));       \
+    v1 = _mm_xor_si128(v1,v3);                                              \
+    v2 = _mm_shuffle_epi32(v2,shuff_const);                                 \
+    v1 = _mm_xor_si128(v1,v2)
+
+struct AES_KEY
+{
+    AES_KEY(const __m128i userkey = _mm_set_epi64x(597349, 121379))
+      : rounds(10)
+    {
+        __m128i x0, x1, x2;
+        rd_key[0] = x0 = userkey;
+        x2 = _mm_setzero_si128();
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 1);
+        rd_key[1] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 2);
+        rd_key[2] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 4);
+        rd_key[3] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 8);
+        rd_key[4] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 16);
+        rd_key[5] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 32);
+        rd_key[6] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 64);
+        rd_key[7] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 128);
+        rd_key[8] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 27);
+        rd_key[9] = x0;
+        EXPAND_ASSIST(x0, x1, x2, x0, 255, 54);
+        rd_key[10] = x0;
+    }
+    __m128i rd_key[11];
+    unsigned int rounds;
+} ;
+
+static const AES_KEY default_aes_key;
+
+static inline void
+AES_ecb_encrypt_blks(__m128i * __restrict__ blks, unsigned int nblks, const AES_KEY * __restrict__ key)
+{
+    for (unsigned int i = 0; i < nblks; ++i)
+        blks[i] = _mm_xor_si128(blks[i], key->rd_key[0]);
+    for (unsigned int j = 1; j < key->rounds; ++j)
+        for (unsigned int i = 0; i < nblks; ++i)
+            blks[i] = _mm_aesenc_si128(blks[i], key->rd_key[j]);
+    for (unsigned int i = 0; i < nblks; ++i)
+        blks[i] = _mm_aesenclast_si128(blks[i], key->rd_key[key->rounds]);
+}
+
+static inline void
+AES_set_decrypt_key_fast(AES_KEY * __restrict__ dkey, const AES_KEY * __restrict__ ekey)
+{
+    int j = 0;
+    int i = ekey->rounds;
+#if (OCB_KEY_LEN == 0)
+    dkey->rounds = i;
+#endif
+    dkey->rd_key[i--] = ekey->rd_key[j++];
+    while (i)
+        dkey->rd_key[i--] = _mm_aesimc_si128(ekey->rd_key[j++]);
+    dkey->rd_key[i] = ekey->rd_key[j];
+}
+
+/*
+static inline void
+AES_set_decrypt_key(__m128i userkey, AES_KEY * __restrict__ key)
+{
+    AES_KEY temp_key;
+    AES_set_encrypt_key(userkey, &temp_key);
+    AES_set_decrypt_key_fast(key, &temp_key);
+}
+*/
+
+static inline void
+AES_ecb_decrypt_blks(__m128i * __restrict__ blks, unsigned nblks, const AES_KEY * __restrict__ key)
+{
+    unsigned i, j, rnds = key->rounds;
+    for (i = 0; i < nblks; ++i)
+        blks[i] = _mm_xor_si128(blks[i], key->rd_key[0]);
+    for (j = 1; j < rnds; ++j)
+        for (i = 0; i < nblks; ++i)
+            blks[i] = _mm_aesdec_si128(blks[i], key->rd_key[j]);
+    for (i = 0; i < nblks; ++i)
+        blks[i] = _mm_aesdeclast_si128(blks[i], key->rd_key[j]);
+}
+
+#endif

preprocessing/bitutils.h

@@ -0,0 +1,199 @@
+/* Copyright (C) 2019  Anonymous
+ *
+ * This is a pre-release version of the DPF++ library distributed anonymously
+ * for peer review. A public release of the software will be published under the
+ * LPGL v2.1 license in the near future. Please do not redistribute this version
+ * of the software.
+ */
+
+#ifndef DPF_BITUTILS_H__
+#define DPF_BITUTILS_H__
+
+#include <bitset>       // std::bitset
+
+#include <x86intrin.h>  // SSE and AVX intrinsics
+
+namespace dpf
+{
+
+static const __m128i bool128_mask[2] = {
+	_mm_set_epi64x(0,1),                                        // 0b00...0001
+	_mm_set_epi64x(1,0)                                         // 0b00...0001 << 64
+};
+static const __m256i bool256_mask[4] = {
+	_mm256_set_epi64x(0,0,0,1),                                 // 0b00...0001
+	_mm256_set_epi64x(0,0,1,0),                                 // 0b00...0001 << 64
+	_mm256_set_epi64x(0,1,0,0),                                 // 0b00...0001 << 128
+	_mm256_set_epi64x(1,0,0,0)                                  // 0b00...0001 << 192
+};
+
+static const __m128i lsb128_mask[4] = {
+	_mm_setzero_si128(),                                        // 0b00...0000
+	_mm_set_epi64x(0,1),                                        // 0b00...0001
+	_mm_set_epi64x(0,2),                                        // 0b00...0010
+	_mm_set_epi64x(0,3)                                         // 0b00...0011
+};
+static const __m128i lsb128_mask_inv[4] = {
+	_mm_set1_epi8(-1),                                          // 0b11...1111
+	_mm_set_epi64x(-1,-2),                                      // 0b11...1110
+	_mm_set_epi64x(-1,-3),                                      // 0b11...1101
+	_mm_set_epi64x(-1,-4)                                       // 0b11...1100
+};
+static const __m128i if128_mask[2] = {
+	_mm_setzero_si128(),                                        // 0b00...0000
+	_mm_set1_epi8(-1)                                           // 0b11...1111
+};
+
+static const __m256i lsb256_mask[4] = {
+	_mm256_setzero_si256(),                                     // 0b00...0000
+	_mm256_set_epi64x(0,0,0,1),                                 // 0b00...0001
+	_mm256_set_epi64x(0,0,0,2),                                 // 0b00...0010
+	_mm256_set_epi64x(0,0,0,3)                                  // 0b00...0011
+};
+static const __m256i lsb256_mask_inv[4] = {
+	_mm256_set1_epi8(-1),                                       // 0b11...1111
+	_mm256_set_epi64x(-1,-1,-1,-2),                             // 0b11...1110
+	_mm256_set_epi64x(-1,-1,-1,-3),                             // 0b11...1101
+	_mm256_set_epi64x(-1,-1,-1,-4)                              // 0b11...1100
+};
+static const __m256i if256_mask[2] = {
+	_mm256_setzero_si256(),                                     // 0b00...0000
+	_mm256_set1_epi8(-1)                                        // 0b11...1111
+};
+
+inline __m128i xor_if(const __m128i & block1, const __m128i & block2, __m128i flag)
+{
+ return _mm_xor_si128(block1, _mm_and_si128(block2, flag));
+}
+
+inline __m256i xor_if(const __m256i & block1, const __m256i & block2, __m256i flag)
+{
+ return _mm256_xor_si256(block1, _mm256_and_si256(block2, flag));
+}
+
+ 
+
+inline __m128i xor_if(const __m128i & block1, const __m128i & block2, bool flag)
+{
+	return _mm_xor_si128(block1, _mm_and_si128(block2, if128_mask[flag ? 1 : 0]));
+}
+inline __m256i xor_if(const __m256i & block1, const __m256i & block2, bool flag)
+{
+	return _mm256_xor_si256(block1, _mm256_and_si256(block2, if256_mask[flag ? 1 : 0]));
+}
+
+inline uint8_t get_lsb(const __m128i & block, uint8_t bits = 0b01)
+{
+	__m128i vcmp = _mm_xor_si128(_mm_and_si128(block, lsb128_mask[bits]), lsb128_mask[bits]);
+	return static_cast<uint8_t>(_mm_testz_si128(vcmp, vcmp));
+}
+inline uint8_t get_lsb(const __m256i & block, uint8_t bits = 0b01)
+{
+	__m256i vcmp = _mm256_xor_si256(_mm256_and_si256(block, lsb256_mask[bits]), lsb256_mask[bits]);
+	return static_cast<uint8_t>(_mm256_testz_si256(vcmp, vcmp));
+}
+template <typename __mX>
+inline uint8_t get_lsb01(const __mX & block) { return get_lsb(block, 0b01); }
+template <typename __mX>
+inline uint8_t get_lsb10(const __mX & block) { return get_lsb(block, 0b10); }
+
+
+inline __m128i clear_lsb(const __m128i & block, uint8_t bits = 0b01)
+{
+	return _mm_and_si128(block, lsb128_mask_inv[bits]);
+}
+inline __m256i clear_lsb(const __m256i & block, uint8_t bits = 0b01)
+{
+	return _mm256_and_si256(block, lsb256_mask_inv[bits]);
+}
+
+template<typename row_t = __m256i >	
+inline std::array<row_t, 128> bitsliced_clear_lsb(std::array<row_t, 128>& block, uint8_t bits = 0b11)
+{
+	if(bits == 0b11)
+	{
+	 block[0] = _mm256_set_epi64x(0, 0, 0, 0); 
+	 block[1] = _mm256_set_epi64x(0, 0, 0, 0); 
+	}
+	if(bits == 0b01)
+	{
+	  block[0] = _mm256_set_epi64x(0, 0, 0, 0); 
+	}
+	return block;
+}
+
+
+template<typename row_t = __m256i >	
+inline std::array<row_t, 128> bitsliced_clear_lsb(const std::array<row_t, 128> block, uint8_t bits = 0b11)
+{
+
+	std::array<row_t, 128> block2 = block;
+	if(bits == 0b11)
+	{
+	 block2[0] = _mm256_set_epi64x(0, 0, 0, 0); 
+	 block2[1] = _mm256_set_epi64x(0, 0, 0, 0); 
+	}
+	if(bits == 0b01)
+	{
+	  block2[0] = _mm256_set_epi64x(0, 0, 0, 0); 
+	}
+	return block2;
+}
+
+
+template<typename row_t = __m256i >	
+inline std::array<row_t, 128> bitsliced_set_lsb(std::array<row_t, 128>& block, row_t t)
+{
+	block[0] = block[0] & t;
+	 
+	return block;
+}
+
+template<typename row_t = __m256i >	
+inline row_t bitslicled_get_lsb(std::array<row_t, 128> block, uint8_t bit = 0b01)
+{	
+	if(bit == 0b01)	
+	{
+	 return block[0];
+	}
+	else if (bit == 0b10)
+	{
+	 return block[1];
+	}
+	else
+	{
+      return block[0];
+	}
+}
+
+template <typename __mX>
+inline __mX clear_lsb01(const __mX & block) { return clear_lsb(block, 0b01); }
+template <typename __mX>
+inline __mX clear_lsb10(const __mX & block) { return clear_lsb(block, 0b10); }
+template <typename __mX>
+inline __mX clear_lsb11(const __mX & block) { return clear_lsb(block, 0b11); }
+
+
+inline __m128i set_lsb(const __m128i & block, const bool val = true)
+{
+	return _mm_or_si128(clear_lsb(block, 0b01), lsb128_mask[val ? 0b01 : 0b00]);
+}
+inline __m256i set_lsb(const __m256i & block, const bool val = true)
+{
+	return _mm256_or_si256(clear_lsb(block, 0b01), lsb256_mask[val ? 0b01 : 0b00]);;
+}
+
+inline __m128i set_lsbs(const __m128i & block, const bool bits[2])
+{
+	int i = (bits[0] ? 1 : 0) + 2 * (bits[1] ? 1 : 0);
+	return _mm_or_si128(clear_lsb(block, 0b11), lsb128_mask[i]);
+}
+inline __m256i set_lsbs(const __m256i & block, const bool bits[2])
+{
+	int i = (bits[0] ? 1 : 0) + 2 * (bits[1] ? 1 : 0);
+	return _mm256_or_si256(clear_lsb(block, 0b11), lsb256_mask[i]);
+}
+
+} 
+
+#endif // DPF_BITUTILS_H__

preprocessing/block.h

@@ -0,0 +1,175 @@
+
+#ifndef LOWMC_BLOCK_H__
+#define LOWMC_BLOCK_H__
+
+#include <bitset>       // std::bitset
+#include <string>       // std::string
+#include <iostream>     // std::istream and std::ostream
+
+#include <x86intrin.h>  // SSE and AVX intrinsics
+
+// namespace lowmc
+// {
+
+template <typename __mX>
+union block
+{
+  public:
+	typedef __mX value_type;
+
+	block(const uint64_t input = 0ULL) : bits(input) { }
+	block(const __mX & val) : mX(val) { }
+	block(const std::string bit_string) : bits(bit_string) { }
+	inline operator __mX() const { return mX; }
+	inline block<__mX> & operator=(const __mX & val) { mX = val; return *this; }
+	inline bool operator==(const __mX & rhs) const;
+	inline bool operator!=(const __mX & rhs) const { return !(*this == rhs); }
+	inline typename std::bitset<sizeof(__mX) * 8>::reference operator[](const size_t pos) { return bits[pos]; }
+	inline const bool operator[](const size_t pos) const { return bits[pos]; }
+	constexpr inline size_t size() const { return sizeof(__mX) * 8; }
+	inline const unsigned parity() const { return bits.count() % 2; }
+	inline void shiftr(const size_t pos) { bits >>= pos; }
+ 	inline void shiftl(const size_t pos) { bits <<= pos; }
+	std::bitset<8 * sizeof(__mX)> bits;
+  //private:
+	block(std::bitset<8 * sizeof(__mX)> & bitset) : bits(bitset) { }
+	__mX mX;
+	
+};
+
+template<>
+inline bool block<__m128i>::operator==(const __m128i & rhs) const
+{
+	auto vcmp = _mm_xor_si128(*this, rhs);
+	return _mm_testz_si128(vcmp, vcmp);
+}
+template<>
+inline bool block<__m256i>::operator==(const __m256i & rhs) const
+{
+	auto vcmp = _mm256_xor_si256(*this, rhs);
+	return _mm256_testz_si256(vcmp, vcmp);
+}
+
+template<typename __mX>
+inline block<__mX> operator|(const block<__mX> & block1, const block<__mX> & block2);
+template<>
+inline block<__m256i> operator|(const block<__m256i> & block1, const block<__m256i> & block2)
+{
+	return _mm256_or_si256(block1, block2);
+}
+ 
+template<>
+inline block<__m128i> operator|(const block<__m128i> & block1, const block<__m128i> & block2)
+{
+	return _mm_or_si128(block1, block2);
+}
+
+template<typename __mX>
+inline block<__mX> operator&(const block<__mX> & block1, const block<__mX> & block2);
+template<>
+inline block<__m256i> operator&(const block<__m256i> & block1, const block<__m256i> & block2)
+{
+	return _mm256_and_si256(block1, block2);
+}
+ 
+template<>
+inline block<__m128i> operator&(const block<__m128i> & block1, const block<__m128i> & block2)
+{
+	return _mm_and_si128(block1, block2);
+}
+
+template<typename __mX>
+inline block<__mX> operator^(const block<__mX> & block1, const block<__mX> & block2);
+ 
+
+template<>
+inline block<__m256i> operator^(const block<__m256i> & block1, const block<__m256i> & block2)
+{
+	return _mm256_xor_si256(block1, block2);
+}
+
+template<>
+inline block<__m128i> operator^(const block<__m128i> & block1, const block<__m128i> & block2)
+{
+	return _mm_xor_si128(block1, block2);
+}
+ 
+template<typename __mX>
+inline block<__mX> & operator^=(block<__mX> & block1, const block<__mX> & block2);
+template<>
+inline block<__m256i> & operator^=(block<__m256i> & block1, const block<__m256i> & block2)
+{
+	block1 = _mm256_xor_si256(block1, block2);
+	return block1;
+}
+template<>
+inline block<__m128i> & operator^=(block<__m128i> & block1, const block<__m128i> & block2)
+{
+	block1 = _mm_xor_si128(block1, block2);
+	return block1;
+}
+
+template<typename __mX>
+inline block<__mX> operator~(const block<__mX> & block);
+
+ 
+
+template<>
+inline block<__m256i> operator~(const block<__m256i> & block)
+{
+	return ~static_cast<__m256i>(block);
+}
+template<>
+inline block<__m128i> operator~(const block<__m128i> & block)
+{
+	return ~static_cast<__m128i>(block);
+}
+
+template<typename __mX>
+inline block<__mX> operator<<(const block<__mX> & block, const long & shift);
+template<>
+inline block<__m256i> operator<<(const block<__m256i> & block , const long & shift)
+{
+	return _mm256_or_si256(_mm256_slli_epi64(block, shift), _mm256_blend_epi32(_mm256_setzero_si256(), _mm256_permute4x64_epi64(_mm256_srli_epi64(block, 64 - shift), _MM_SHUFFLE(2,1,0,0)), _MM_SHUFFLE(3,3,3,0)));
+}
+template<>
+inline block<__m128i> operator<<(const block<__m128i> & block, const long & shift)
+{
+  return _mm_or_si128(_mm_slli_epi64(block, shift), _mm_srli_epi64(_mm_slli_si128(block, 8), 64 - shift));
+}
+template<typename __mX>
+inline block<__mX> & operator<<=(block<__mX> & block, const long & shift)
+{
+	block = block << shift;
+	return block;
+}
+
+template<typename __mX>
+inline block<__mX> operator>>(const block<__mX> & block, const long & shift);
+
+// template<>
+// inline block<__m256i> operator>>(const block<__m256i> & block, const long & shift)
+// {
+// 	return _mm256_or_si256(_mm256_srli_epi64(block, shift), _mm256_blend_epi32(_mm256_setzero_si256(), _mm256_permute4x64_epi64(_mm256_slli_epi64(block, 64 - shift), _MM_SHUFFLE(0,3,2,1)), _MM_SHUFFLE(0,3,3,3)));
+// }
+
+template<>
+inline block<__m256i> operator>>(const block<__m256i> & block, const long & shift)
+{
+	return _mm256_or_si256(_mm256_srli_epi64(block, shift), _mm256_blend_epi32(_mm256_setzero_si256(), _mm256_permute4x64_epi64(_mm256_slli_epi64(block, 64 - shift), _MM_SHUFFLE(0,3,2,1)), _MM_SHUFFLE(0,3,3,3)));
+}
+template<>
+inline block<__m128i> operator>>(const block<__m128i> & block, const long & shift)
+{
+	return _mm_or_si128(_mm_srli_epi64(block, shift), _mm_slli_epi64(_mm_srli_si128(block, 8), 64 - shift));
+}
+template<typename __mX>
+inline block<__mX> & operator>>=(block<__mX> & block, const long & shift)
+{
+	block = block >> shift;
+	return block;
+}
+
+//} // namespace lowmc
+
+#endif // LOWMC_BLOCK_H__

preprocessing/dpfgen.h

@@ -0,0 +1,823 @@
+	struct dpfP2
+	{
+		__m128i root;
+		__m128i CW[26];
+		uint8_t cwt_L[26];
+		uint8_t cwt_R[26];
+	};
+
+void generate_random_targets(uint8_t ** target_share_read, size_t n_threads, bool party, size_t expo)
+{
+    for(size_t i = 0; i < n_threads; i++)
+	{
+		target_share_read[i] = new uint8_t[64];
+	}
+
+	for(size_t j = 0; j < 64; ++j)
+	{	
+ 		for(size_t i = 0; i < n_threads; ++i)
+		{
+			srand(3);
+			uint8_t random_value;
+			arc4random_buf(&random_value, sizeof(uint8_t));
+			target_share_read[i][j] = random_value;//rand();
+			target_share_read[i][j] = 0;//target_share_read[i][j] % 2;
+			if(party) target_share_read[i][expo-2] = 1;
+		}
+	}
+}
+
+void write_evalfull_outs_into_a_file(bool party, size_t i, size_t db_nitems,  int8_t ** flags, int64_t * outs_, __m128i * final_correction_word)
+{
+ if(!party) 
+ {  
+   	char const * p0_filename0;
+	char tmp[100];
+   	p0_filename0 = "../duoram-online/party0_read_flags_b";
+	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+	
+	int w0 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	int written = write(w0, flags[i], db_nitems * sizeof(flags[i][0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w0);
+
+ 	 p0_filename0 = "../duoram-online/party0_read_flags_c";
+   	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	 int w1 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+     written = write(w1, flags[i], db_nitems * sizeof(flags[i][0]));
+     if(written<0) {
+             perror("Write error");
+       }
+      close(w1);
+	
+	  p0_filename0 = "../duoram-online/party0_read_flags_d";
+	  	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	  int w2 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	   written = write(w2, flags[i], db_nitems * sizeof(flags[i][0]));
+      
+	  if(written<0) {
+             perror("Write error");
+       }  
+	  close(w2);
+
+
+	p0_filename0 = "../duoram-online/party0_write_flags_b";
+		strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    int w4 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w4, flags[i], db_nitems * sizeof(flags[i][0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w4);
+
+   p0_filename0 = "../duoram-online/party0_write_flags_c";
+   	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    int w5 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w5, flags[i], db_nitems * sizeof(flags[i][0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w5);
+	  p0_filename0 = "../duoram-online/party0_write_flags_d";
+	  	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	   int w6 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	   written = write(w6, flags[i], db_nitems * sizeof(flags[i][0]));
+      
+	  if(written<0) {
+             perror("Write error");
+       }
+      
+	  close(w6);
+
+	p0_filename0 = "../duoram-online/party0_write_b";
+		strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    w4 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w4, outs_, db_nitems * sizeof(outs_[0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w4);
+
+ 	  p0_filename0 = "../duoram-online/party0_write_c";
+	  	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+     w5 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w5, outs_, db_nitems * sizeof(outs_[0]));
+      if(written<0) {
+             perror("Write error");
+       }
+    close(w5);
+
+    p0_filename0 = "../duoram-online/party0_write_d";
+		strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	w6 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	written = write(w6, outs_, db_nitems * sizeof(outs_[0]));
+      
+	if(written<0) {
+             perror("Write error");
+       }
+      
+	  close(w6);
+	  
+  }
+  if(party) 
+  {
+	 char const * p0_filename0;
+	 char tmp[100];
+     p0_filename0 = "../duoram-online/party1_read_flags_b";
+	 strcpy(tmp, p0_filename0);
+ 	 strcat(tmp, std::to_string(i).c_str());
+     
+	 int w0 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+     int written = write(w0, flags[i], db_nitems * sizeof(flags[i][0]));
+     if(written<0) {
+             perror("Write error");
+       }
+     
+	 close(w0);	
+
+	 p0_filename0 = "../duoram-online/party1_read_flags_c";
+	 strcpy(tmp, p0_filename0);
+ 	 strcat(tmp, std::to_string(i).c_str());
+   	 
+	 int w1 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+	 written = write(w1, flags[i], db_nitems * sizeof(flags[i][0]));
+	 if(written<0) {
+             perror("Write error");
+       }
+      close(w1);
+
+	  p0_filename0 = "../duoram-online/party1_read_flags_d";
+	  strcpy(tmp, p0_filename0);
+ 	  strcat(tmp, std::to_string(i).c_str());
+   	  
+	  int w2 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	   written = write(w2,flags[i], db_nitems * sizeof(flags[i][0]));
+      
+	  if(written<0) {
+             perror("Write error");
+       }
+      
+	  close(w2);
+
+
+	p0_filename0 = "../duoram-online/party1_write_flags_b";
+	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    
+	int w4 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w4,flags[i], db_nitems * sizeof(flags[i][0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w4);
+
+   	p0_filename0 = "../duoram-online/party1_write_flags_c";
+	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    
+	int w5 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w5, flags[i], db_nitems * sizeof(flags[i][0]));
+     if(written<0) {
+             perror("Write error");
+       }
+      close(w5);
+	
+	p0_filename0 = "../duoram-online/party1_write_flags_d";
+	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	   
+	int w6 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	written = write(w6, flags[i], db_nitems * sizeof(flags[i][0]));  
+	if(written<0) {
+             perror("Write error");
+       }
+      
+	close(w6);
+
+	p0_filename0 = "../duoram-online/party1_write_b";
+	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+
+    w4 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w4, outs_, db_nitems * sizeof(outs_[0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w4);
+
+ //  char const * p0_filename0;
+   p0_filename0 = "../duoram-online/party1_write_c";
+   	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+    w5 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+    written = write(w5, outs_, db_nitems * sizeof(outs_[0]));
+      if(written<0) {
+             perror("Write error");
+       }
+      close(w5);
+	  p0_filename0 = "../duoram-online/party1_write_d";
+	  	strcpy(tmp, p0_filename0);
+ 	strcat(tmp, std::to_string(i).c_str());
+   	    w6 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+   	   written = write(w6, outs_, db_nitems * sizeof(outs_[0]));
+      
+	  if(written<0) {
+             perror("Write error");
+       }
+      
+	  close(w6);
+  }
+
+  	if(party)
+	{
+		char const * p1_filename0;
+		char tmp[100];
+		p1_filename0 = "../duoram-online/FCW1";
+		strcpy(tmp, p1_filename0);
+ 		strcat(tmp, std::to_string(i).c_str());
+		
+		int w0 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+		int written = write(w0, &final_correction_word[0][0],  sizeof(final_correction_word[0][0]));
+		if(written<0) {
+				perror("Write error");
+		}
+		close(w0);
+	}
+	
+	if(!party)
+	{
+		char const * p0_filename0;
+		char tmp[100];
+		p0_filename0 = "../duoram-online/FCW0";
+		strcpy(tmp, p0_filename0);
+ 		strcat(tmp, std::to_string(i).c_str());
+		
+		int w0 = open( tmp, O_WRONLY | O_CREAT, S_IWRITE | S_IREAD);
+		int written = write(w0, &final_correction_word[0][0],  sizeof(final_correction_word[0][0]));
+		if(written<0) {
+				perror("Write error");
+		}
+		close(w0);
+	}
+}
+
+void compute_CW(tcp::socket& sout, tcp::socket& sin, __m128i L, __m128i R, uint8_t bit, __m128i & CW)
+{
+
+	struct cw_construction
+	{
+	  __m128i rand_b, gamma_b;
+	  uint8_t bit_b;
+	};
+
+
+	cw_construction computecw;
+
+	read(sin, boost::asio::buffer(&computecw, sizeof(computecw)));
+
+	__m128i rand_b  = computecw.rand_b;
+	__m128i gamma_b = computecw.gamma_b;
+	uint8_t bit_b   = computecw.bit_b;
+	
+
+
+	#ifdef DEBUG 
+		__m128i rand_b2, gamma_b2;
+		uint8_t bit_b2;
+	 	read(sin, boost::asio::buffer(&rand_b2, sizeof(rand_b)));
+	    read(sin, boost::asio::buffer(&gamma_b2, sizeof(gamma_b)));
+	    read(sin, boost::asio::buffer(&bit_b2, sizeof(bit_b)));
+
+	    assert(rand_b2[0] == rand_b[0]);
+	    assert(rand_b2[1] == rand_b[1]);
+		assert(gamma_b2[0] == gamma_b[0]);
+	    assert(gamma_b2[1] == gamma_b[1]);
+		assert(bit_b2 == bit_b);
+ 	#endif
+
+	uint8_t blinded_bit, blinded_bit_read;
+	blinded_bit = bit ^ bit_b;
+
+	__m128i blinded_L = L ^ R ^ rand_b;
+	__m128i blinded_L_read; 
+
+
+	struct BlindsCW
+	{
+		__m128i blinded_message;
+		uint8_t blinded_bit;
+	};
+
+	BlindsCW blinds_sent, blinds_recv;
+
+	blinds_sent.blinded_bit = blinded_bit;
+	blinds_sent.blinded_message = blinded_L;
+
+ 
+ 
+ 	boost::asio::write(sout, boost::asio::buffer(&blinds_sent, sizeof(blinds_sent)));
+	boost::asio::read(sout, boost::asio::buffer(&blinds_recv, sizeof(blinds_recv)));
+	
+	blinded_bit_read = blinds_recv.blinded_bit;
+	blinded_L_read   =  blinds_recv.blinded_message;
+
+	__m128i out_ = R ^ gamma_b;//_mm_setzero_si128;
+
+	if(bit)
+	{
+	 out_ ^= (L ^ R ^ blinded_L_read);
+	}
+	if(blinded_bit_read)
+	{
+	 out_ ^= rand_b;
+	}
+
+	__m128i out_reconstruction; 
+	boost::asio::write(sout, boost::asio::buffer(&out_, sizeof(out_)));
+	boost::asio::read(sout, boost::asio::buffer(&out_reconstruction, sizeof(out_reconstruction)));
+	out_reconstruction = out_ ^ out_reconstruction;
+	
+	CW = out_reconstruction;
+	
+	#ifdef DEBUG
+		uint8_t bit_reconstruction; 
+		boost::asio::write(sout, boost::asio::buffer(&bit, sizeof(bit)));
+		boost::asio::read(sout, boost::asio::buffer(&bit_reconstruction, sizeof(bit_reconstruction)));
+		bit_reconstruction = bit ^ bit_reconstruction;
+
+		__m128i L_reconstruction; 
+		boost::asio::write(sout, boost::asio::buffer(&L, sizeof(L)));
+		boost::asio::read(sout, boost::asio::buffer(&L_reconstruction, sizeof(L_reconstruction)));
+		L_reconstruction = L ^ L_reconstruction;
+
+		__m128i R_reconstruction; 
+		boost::asio::write(sout, boost::asio::buffer(&R, sizeof(R)));
+		boost::asio::read(sout, boost::asio::buffer(&R_reconstruction, sizeof(R_reconstruction)));
+		R_reconstruction = R ^ R_reconstruction;
+
+	 	__m128i CW_debug;
+
+		if(bit_reconstruction != 0)
+		{
+		  CW_debug = L_reconstruction;
+		}
+		else
+		{
+		  CW_debug = R_reconstruction;
+		}
+
+		assert(CW_debug[0] == CW[0]);
+		assert(CW_debug[1] == CW[1]);
+	#endif
+	
+}
+
+
+template<typename node_t, typename prgkey_t>
+static inline void traverse(const prgkey_t & prgkey, const node_t & seed,	node_t s[2])
+{	
+	dpf::PRG(prgkey, clear_lsb(seed, 0b11), s, 2);
+} // dpf::expand
+
+/**
+ * @brief 
+ * 
+ * @param nodes_per_leaf 
+ * @param depth 
+ * @param nbits 
+ * @param nodes_in_interval 
+ * @param prgkey The PRG Key
+ * @param target_share 
+ * @param socketsPb Array of sockets to write to Pb
+ * @param socketsP2 Array of sockets to write to P2
+ * @param from 
+ * @param to 
+ * @param output 
+ * @param _t 
+ * @param final_correction_word the final correction word is written in to this 
+ * @param party Party
+ * @param socket_no 
+ */
+inline void create_dpfs(  size_t db_nitems,
+							 const AES_KEY& prgkey,  uint8_t target_share[64], std::vector<socket_t>& socketsPb, std::vector<socket_t>& socketsP2,
+							 const size_t from, const size_t to, __m128i * output, int8_t * _t, __m128i& final_correction_word, bool party, size_t socket_no, size_t ind)
+{
+
+    const size_t bits_per_leaf = std::is_same<leaf_t, bool>::value ? 1 : sizeof(leaf_t) * CHAR_BIT;
+	const bool  is_packed = (sizeof(leaf_t) < sizeof(node_t));
+	const size_t nodes_per_leaf = is_packed ? 1 : std::ceil(static_cast<double>(bits_per_leaf) / (sizeof(node_t) * CHAR_BIT));
+
+    const size_t depth = std::ceil(std::log2(db_nitems));
+	const size_t nbits = std::ceil(std::log2(db_nitems));
+	const size_t nodes_in_interval = db_nitems-1; 
+	
+	__m128i root;
+	
+	arc4random_buf(&root, sizeof(root));
+    
+    root =	set_lsb(root, party);
+
+	const size_t from_node = std::floor(static_cast<double>(from) / nodes_per_leaf);
+
+	__m128i * s[2] = {
+	    reinterpret_cast<__m128i *>(output) + nodes_in_interval * (nodes_per_leaf - 1),
+	    s[0] + nodes_in_interval / 2
+	};
+	
+	int8_t * t[2] = { _t, _t + nodes_in_interval / 2};
+
+	int curlayer = depth % 2;
+
+	s[curlayer][0] = root;
+	t[curlayer][0] = get_lsb(root, 0b01);
+	
+	__m128i * CW = (__m128i *) std::aligned_alloc(sizeof(__m256i), depth * sizeof(__m128i));
+	
+	if(ind == 0)
+	{
+		std::cout << "root = "         << root[0] << " " << root[1] << std::endl;
+		std::cout << "t[curlayer][0] " << (int) t[curlayer][0] << std::endl;
+	}
+
+	// struct dpfP2
+	// {
+	// 	__m128i root;
+	// 	__m128i CW[26];
+	// 	uint8_t cwt_L[26];
+	// 	uint8_t cwt_R[26];
+	// };
+	
+	dpfP2 dpf_instance;
+	dpf_instance.root           = root;
+	for (size_t layer = 0; layer < depth; ++layer)
+	{
+			#ifdef VERBOSE	
+				printf("layer = %zu\n", layer);
+			#endif
+
+			curlayer = 1-curlayer;
+
+			size_t i=0, j=0;
+			auto nextbit = (from_node >> (nbits-layer-1)) & 1;
+			size_t nodes_in_prev_layer = std::ceil(static_cast<double>(nodes_in_interval) / (1ULL << (depth-layer)));
+			size_t nodes_in_cur_layer = std::ceil(static_cast<double>(nodes_in_interval) / (1ULL << (depth-layer-1)));
+
+			__m128i L =  _mm_setzero_si128();
+			__m128i R =  _mm_setzero_si128();
+			
+			for (i = nextbit, j = nextbit; j < nodes_in_prev_layer-1; ++j, i+=2)
+			{
+				traverse(prgkey, s[1-curlayer][j], &s[curlayer][i]);
+				L ^= s[curlayer][i];
+				R ^= s[curlayer][i+1];
+			}
+			
+			if (nodes_in_prev_layer > j)
+			{
+				if (i < nodes_in_cur_layer - 1) 
+				{
+					traverse(prgkey, s[1-curlayer][j], &s[curlayer][i]);
+					L ^= s[curlayer][i];
+					R ^= s[curlayer][i+1];
+				}
+			}
+
+			compute_CW(socketsPb[socket_no], socketsP2[socket_no], L,  R, target_share[layer], CW[layer]);
+
+			uint8_t advice_L = get_lsb(L) ^ target_share[layer];
+			uint8_t advice_R = get_lsb(R) ^ target_share[layer];
+
+			uint8_t cwt_L, cwt_R;
+		
+			uint8_t advice[2];
+			uint8_t cwts[2];	
+
+			advice[0] = advice_L;
+			advice[1] = advice_R;
+			
+			boost::asio::write(socketsPb[socket_no+1], boost::asio::buffer(&advice, sizeof(advice)));
+			boost::asio::read(socketsPb[socket_no+1], boost::asio::buffer(&cwts, sizeof(cwts)));
+			
+			cwt_L = cwts[0];
+			cwt_R = cwts[1];
+
+			cwt_L = cwt_L ^ advice_L ^ 1;
+			cwt_R = cwt_R ^ advice_R;	 	
+			
+			 #ifdef DEBUG
+				if(ind == 0) 
+				{ 
+					std::cout << "CW reconstruction  = " << CW[layer][0] << " " << CW[layer][1] << std::endl;
+					std::cout << "			   cwt_L = " << (int) cwt_L << std::endl;
+					std::cout << "			   cwt_R = " << (int) cwt_R << std::endl;
+				}
+			#endif
+			
+			
+			dpf_instance.CW[layer] 		=  CW[layer];
+			dpf_instance.cwt_L[layer]   =  cwt_L;
+			dpf_instance.cwt_R[layer]   =  cwt_R;
+			
+
+
+			for(size_t j = 0; j < nodes_in_prev_layer; ++j)
+			{	
+				t[curlayer][2*j] 	 = get_lsb(s[curlayer][2*j]) ^ (cwt_L & t[1-curlayer][j]);
+				s[curlayer][2*j] 	 = clear_lsb(xor_if(s[curlayer][2*j], CW[layer], !t[1-curlayer][j]), 0b11);
+				t[curlayer][(2*j)+1] = get_lsb(s[curlayer][(2*j)+1]) ^ (cwt_R & t[1-curlayer][j]);
+				s[curlayer][(2*j)+1] = clear_lsb(xor_if(s[curlayer][(2*j)+1], CW[layer], !t[1-curlayer][j]), 0b11);
+			}
+	}
+ 
+		boost::asio::write(socketsP2[socket_no+1], boost::asio::buffer(&dpf_instance, sizeof(dpfP2)));
+	 
+	__m128i Gamma  =  _mm_setzero_si128();
+	 
+	for (size_t i = 0; i < to + 1; ++i)
+	{
+	  Gamma[0] += output[i][0];
+	  Gamma[1] += output[i][1]; // the correction word for share conversion
+	}
+		
+	if(party) 
+	{
+	  Gamma[0] = -Gamma[0];
+	  Gamma[1] = -Gamma[1];  // the correction word for share conversion
+	}
+	
+	// boost::asio::write(socketsPb[socket_no + 3], boost::asio::buffer(&Gamma, sizeof(Gamma)));
+ 	// boost::asio::read(socketsPb[socket_no + 3], boost::asio::buffer(&final_correction_word, sizeof(final_correction_word)));
+
+ 	final_correction_word = Gamma; // final_correction_word + Gamma;
+
+} // dpf::__evalinterval
+
+
+
+
+
+
+
+inline void evaluate_dpfs( size_t db_nitems,  dpfP2 dpfinstance,  const AES_KEY& prgkey,   const size_t from, const size_t to, 
+							__m128i * output, int8_t * _t, __m128i& final_correction_word, bool party,  
+							size_t ind)
+{
+
+    const size_t bits_per_leaf = std::is_same<leaf_t, bool>::value ? 1 : sizeof(leaf_t) * CHAR_BIT;
+	const bool  is_packed = (sizeof(leaf_t) < sizeof(node_t));
+	const size_t nodes_per_leaf = is_packed ? 1 : std::ceil(static_cast<double>(bits_per_leaf) / (sizeof(node_t) * CHAR_BIT));
+
+    const size_t depth = std::ceil(std::log2(db_nitems));
+	const size_t nbits = std::ceil(std::log2(db_nitems));
+	const size_t nodes_in_interval = db_nitems-1; 
+	
+	__m128i root = dpfinstance.root;
+	__m128i * CW = (__m128i *) std::aligned_alloc(sizeof(__m256i), depth * sizeof(__m128i));
+	uint8_t * cwt_L = (uint8_t *) std::aligned_alloc(sizeof(__m256i), depth * sizeof(uint8_t));
+	uint8_t * cwt_R = (uint8_t *) std::aligned_alloc(sizeof(__m256i), depth * sizeof(uint8_t));
+	for(size_t j = 0; j < depth; ++j)
+	{
+		CW[j] 	  = dpfinstance.CW[j];
+		cwt_L[j]  = dpfinstance.cwt_L[j];
+		cwt_R[j]  = dpfinstance.cwt_R[j];
+	}
+	
+ 
+    root =	set_lsb(root, party);
+
+	const size_t from_node = std::floor(static_cast<double>(from) / nodes_per_leaf);
+
+	__m128i * s[2] = {
+	    reinterpret_cast<__m128i *>(output) + nodes_in_interval * (nodes_per_leaf - 1),
+	    s[0] + nodes_in_interval / 2
+	};
+	
+	int8_t * t[2] = { _t, _t + nodes_in_interval / 2};
+
+	int curlayer = depth % 2;
+
+	s[curlayer][0] = root;
+	t[curlayer][0] = get_lsb(root, 0b01);
+	 	if(ind == 0)
+	{
+		std::cout << "root = "         << root[0] << " " << root[1] << std::endl;
+		std::cout << "t[curlayer][0] " << (int) t[curlayer][0] << std::endl;
+	}
+
+	for (size_t layer = 0; layer < depth; ++layer)
+	{
+			#ifdef VERBOSE	
+				printf("layer = %zu\n", layer);
+			#endif
+
+			curlayer = 1-curlayer;
+
+			size_t i=0, j=0;
+			auto nextbit = (from_node >> (nbits-layer-1)) & 1;
+			size_t nodes_in_prev_layer = std::ceil(static_cast<double>(nodes_in_interval) / (1ULL << (depth-layer)));
+			size_t nodes_in_cur_layer = std::ceil(static_cast<double>(nodes_in_interval) / (1ULL << (depth-layer-1)));
+
+
+			
+ 			for (i = nextbit, j = nextbit; j < nodes_in_prev_layer-1; ++j, i+=2)
+			{
+				traverse(prgkey, s[1-curlayer][j], &s[curlayer][i]);
+
+			}
+			
+			if (nodes_in_prev_layer > j)
+			{
+				if (i < nodes_in_cur_layer - 1) 
+				{
+					traverse(prgkey, s[1-curlayer][j], &s[curlayer][i]);
+	
+				}
+			}
+
+			//#ifdef DEBUG
+				if(ind == 0) 
+				{ 
+					std::cout << "CW reconstruction  = " << CW[layer][0] << " " << CW[layer][1] << std::endl;
+					std::cout << "			   cwt_L = " << (int) cwt_L[layer] << std::endl;
+					std::cout << "			   cwt_R = " << (int) cwt_R[layer] << std::endl;
+				}
+			//#endif
+			for(size_t j = 0; j < nodes_in_prev_layer; ++j)
+			{	
+				t[curlayer][2*j] 	 = get_lsb(s[curlayer][2*j]) ^ (cwt_L[layer] & t[1-curlayer][j]);
+				s[curlayer][2*j] 	 = clear_lsb(xor_if(s[curlayer][2*j], CW[layer], !t[1-curlayer][j]), 0b11);
+				t[curlayer][(2*j)+1] = get_lsb(s[curlayer][(2*j)+1]) ^ (cwt_R[layer] & t[1-curlayer][j]);
+				s[curlayer][(2*j)+1] = clear_lsb(xor_if(s[curlayer][(2*j)+1], CW[layer], !t[1-curlayer][j]), 0b11);
+			}
+	}
+
+	__m128i Gamma  =  _mm_setzero_si128();
+	 
+	for (size_t i = 0; i < to + 1; ++i)
+	{
+	  Gamma[0] += output[i][0];
+	  Gamma[1] += output[i][1]; // the correction word for share conversion
+	}
+		
+	if(party) 
+	{
+	  Gamma[0] = -Gamma[0];
+	  Gamma[1] = -Gamma[1];  // the correction word for share conversion
+	}
+	
+
+ 	final_correction_word = Gamma; // final_correction_word + Gamma;
+
+} // dpf::__evalinterval
+
+// void convert_shares(size_t i, __m128i ** output, int8_t ** flags, size_t n_threads, size_t db_nitems, __m128i * final_correction_word, 
+// 					int64_t ** leaves, int64_t ** leafbits,
+// 					tcp::socket& sb, tcp::socket& s2, bool party)
+// {
+	
+// 	#ifdef DEBUG
+// 		std::cout << "share conversion " << i << "-th, thread started runing" << std::endl << std::endl;
+// 	#endif
+
+// 	for(size_t j = 0; j < db_nitems; ++j)
+// 	{
+// 		if(party)
+// 		{
+// 			output[i][j] = -output[i][j];
+// 			flags[i][j]  =  -flags[i][j]; 
+// 		}
+// 	}
+
+// 	int64_t pm = 0;
+// 	int64_t rb, rb_prime;
+
+// 	arc4random_buf(&rb, sizeof(rb));
+
+// 	for(size_t j = 0; j < db_nitems; ++j)
+// 	{
+// 		if(party)
+// 		{
+// 		  if(flags[i][j] != 0)	pm -= 1;
+// 		}
+// 		if(!party)
+// 		{
+// 		 if(flags[i][j] != 0)	pm += 1;//flags[0][j];
+// 		}
+// 	}
+
+// 	rb_prime = du_attalah_Pb(rb, pm, s2, sb);
+
+// 	int64_t FCWshare = du_attalah_Pb(final_correction_word[i][1] + rb_prime, pm, s2, sb);
+
+// 	int64_t tmpfcw =  du_attalah_Pb(final_correction_word[i][1], pm, s2, sb);
+	
+// 	int64_t test0, test1, test;
+// 	test1 = 0;
+// 	test0 = 0;
+// 	for(size_t j = 0; j < db_nitems; ++j)
+// 	{
+// 		test0 += flags[i][j] * final_correction_word[i][1];
+// 		if(flags[i][j] == 0) test1 +=  final_correction_word[i][1];
+// 	}
+// 	test1 = -test1;
+// 	test = test0 + test1;
+// 	//tmpfcw += rb;
+
+// 	int64_t test_reconstruction;
+//  	boost::asio::write(sb, boost::asio::buffer(&test, sizeof(test)));
+// 	boost::asio::read(sb, boost::asio::buffer(&test_reconstruction, sizeof(test_reconstruction)));
+// 	test_reconstruction = test_reconstruction + test;
+
+// 	int64_t tmpfcw_reconstruction;
+//  	boost::asio::write(sb, boost::asio::buffer(&tmpfcw, sizeof(tmpfcw)));
+// 	boost::asio::read(sb, boost::asio::buffer(&tmpfcw_reconstruction, sizeof(tmpfcw_reconstruction)));
+// 	tmpfcw_reconstruction = tmpfcw_reconstruction + tmpfcw;
+
+// 	int64_t FCWshare_reconstruction;
+//  	boost::asio::write(sb, boost::asio::buffer(&FCWshare, sizeof(FCWshare)));
+// 	boost::asio::read(sb, boost::asio::buffer(&FCWshare_reconstruction, sizeof(FCWshare_reconstruction)));
+// 	FCWshare_reconstruction = FCWshare_reconstruction + FCWshare;
+
+// 	//std::cout << tmpfcw_reconstruction << " <----> " << test_reconstruction << std::endl;
+	
+// 	int64_t PM = pm + rb;
+// 	int64_t PM_recv;
+
+// 	boost::asio::write(sb, boost::asio::buffer(&PM, sizeof(PM)));
+// 	boost::asio::read(sb, boost::asio::buffer(&PM_recv, sizeof(PM_recv)));
+    
+//     int64_t * flags_  = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+// 	int64_t * outs_  = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+	
+// 	for(size_t j = 0; j < db_nitems; ++j)
+// 	{
+// 		outs_[j] = output[0][j][0];
+// 		leaves[i][j] = output[i][j][0];
+
+// 		#ifdef DEBUG
+// 			int64_t out_rec;
+// 			boost::asio::write(sb, boost::asio::buffer(&outs_[j], sizeof(outs_[j])));
+// 			boost::asio::read(sb, boost::asio::buffer(&out_rec, sizeof(out_rec)));
+// 			out_rec = out_rec + outs_[j];
+
+// 			if(out_rec != 0) std::cout << j << "-> " << out_rec << std::endl;
+// 		#endif
+
+// 		flags_[j] = (flags[i][j] * pm) + (flags[i][j] * PM_recv) + (flags[i][j] * rb); 
+ 
+// 		flags_[j] += output[i][j][1]; 
+
+// 		if(!party)
+// 		{	
+// 			flags_[j] -= (flags[i][j] * FCWshare_reconstruction);		
+// 		}
+// 		if(party)
+// 		{ 
+// 			flags_[j] -= (flags[i][j] * FCWshare_reconstruction);
+// 		}
+	
+// 		#ifdef DEBUG
+// 		int64_t flags_rec;
+// 		boost::asio::write(sb, boost::asio::buffer(&flags_[j], sizeof(flags_[j])));
+// 		boost::asio::read(sb, boost::asio::buffer(&flags_rec, sizeof(flags_rec)));
+// 		flags_rec = flags_rec + flags_[j];
+
+// 		if(flags_rec != 0)
+// 		{
+// 			 std::cout << j << " ---> Flag Reconstruction = " << flags_rec << std::endl;
+// 		}
+// 		#endif
+		
+ 
+// 		flags[i][j] = flags_[j];
+		
+// 		if(flags[i][j] == 128 || flags[i][j] == -128) flags[i][j] = 0;
+// 		leafbits[i][j] = flags[i][j];
+
+// 		#ifdef DEBUG
+// 			int8_t flags_rec2;
+// 			boost::asio::write(sb, boost::asio::buffer(&flags[i][j], sizeof(flags[i][j])));
+// 			boost::asio::read(sb, boost::asio::buffer(&flags_rec2, sizeof(flags_rec2)));
+// 			flags_rec2 = flags_rec2 + flags[i][j];
+
+// 			if(flags_rec2 != 0)
+// 			{
+// 				std::cout << j << " ---> Flag Reconstruction = " << (int) flags_rec2 << std::endl;
+// 				if(flags_rec2 != 1) std::cout << (int) flags[i][j]  << "-> " << flags_[j] << std::endl;
+// 			}
+// 		#endif
+// 	}
+
+// 	  write_evalfull_outs_into_a_file(party, i, db_nitems, flags,  leaves[0], final_correction_word); 
+// }

preprocessing/log

@@ -0,0 +1,643 @@
+root = root = 8896503317097076922root = 3002083365153773868 4926876539067426654
+t[curlayer][0] 0
+root = -637257582663169504 -4391273733883787602
+t[curlayer][0] 0
+CW reconstruction  = -2456022676870330044 -1907173758612498330
+root = 			   cwt_L = 29552699697901801681 7291235561806926295
+t[curlayer][0] 0
+CW reconstruction  = 3701083426696026396 -6783603624145694503
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3772560451823546080 -4596212825090978039
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -4771120570940942067 -402934123732053403
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2101390645211348906 4521694825746439098
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7202946082625135017 -1136524974173336124
+			   cwt_L = 0
+-2449610946659922138 -1403380406722631778
+t[curlayer][0] 0
+ CW reconstruction  = -7092505473151087775 4790999556117808555
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5934974968610828171 -2796114086571632936
+			   cwt_L = 0
+			   cwt_R = 1
+
+			   cwt_R = 0
+CW reconstruction  = -3819394960044050762 593183849756989047
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -9077204822343288836 -3455168465609490502
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 6842259862688790635 CW reconstruction  = 3423355720896775506 -2408060190204940974
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -1841102334676139575 -2961133002687052438
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6797726179374773709 6904006627677348053
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 341010023312831502 -3555664227996066346
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -4939883106194477021 3389059474705412972
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3994168847681425832 -7242641677190267778
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3125965333469620908 609908640072715778
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -1081609072637326902 -5172693106068232614
+			   cwt_L = 1
+			   cwt_R = 0
+root = root = -1054516438452372961 2922836179211098614
+t[curlayer][0] 1
+CW reconstruction  = CW reconstruction  = -7092505473151087775 4790999556117808555
+-3650034873080725342 			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5934974968610828171 -2796114086571632936
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 3423355720896775506 -2408060190204940974
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -1841102334676139575 -2961133002687052438
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6797726179374773709 6904006627677348053
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 341010023312831502 -3555664227996066346root = -5067451043666459316 520731607431194600
+t[curlayer][0] 0
+root = CW reconstruction  = -8363432580913261508 -2163299488963063227
+root = 			   cwt_L = -5432118977031182430 1492381416749209269
+t[curlayer][0] 0
+CW reconstruction  = 
+			   cwt_L = 1
+			   cwt_R = 0
+root = 6606052626595215488 -550808610728692316
+t[curlayer][0] 0
+CW reconstruction  = -2899844322123127050 7207715151810147454
+			   cwt_R = 1
+CW reconstruction  = -4150808768078305625 -2020724302294450878
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5419764563595921958 -3670676214363085595
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -2120972055657306655 -5671499908858970397
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -6851643979739564324 7998271472026158147
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -3480063414359239572 -4491475554622187678
+			   cwt_L = 1
+			   cwt_R = 0
+root = -4872923630488609179 39713950987452594
+t[curlayer][0] 1
+CW reconstruction  = 3701083426696026396 -6783603624145694503
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3772560451823546080 -4596212825090978039
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -4771120570940942067 -402934123732053403
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2101390645211348906 4521694825746439098
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7202946082625135017 -1136524974173336124
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -4150808768078305625 -2020724302294450878
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5419764563595921958 -3670676214363085595
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -2120972055657306655 -5671499908858970397
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -6851643979739564324 7998271472026158147
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -3480063414359239572 -4491475554622187678
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -4939883106194477021 3389059474705412972
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3994168847681425832 -7242641677190267778
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3125965333469620908 609908640072715778
+			   cwt_L = 0
+			   cwt_R = 1
+-1714690163973575658CW reconstruction  = -1081609072637326902 -5172693106068232614
+			   cwt_L = 1
+			   cwt_R = 0
+2119612039764700363
+t[curlayer][0] 0
+0CW reconstruction  = -3792976198772274362 1698871011528114433
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 128959945223434670 -3949124424736479116
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3582423452126394845 -3700357098368425547
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 8205180591738942578 -7785329013424496929
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -2090489738783498788 540450259860303607
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -8053465502487163790 -6243831973386108064
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 6365652239971190354 3299159852882774010
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 523004862765125575 2078573986257932543
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6857993168414977639 -6510128578683193671
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 8083723636189578387 -2280114371125429031
+			   cwt_L = 0
+			   cwt_R = 1
+-8549440673305664837
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -8632031367124025977 7603420969189570615
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6139289106911615722 5809901092902830746
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7596273567520062365 -974092418002596676
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5497114317768809317 -8661367164627693410
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -7070987558120284154 -1099931929772746150
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2367036512505867824 5299325163353017345
+			   cwt_L = 0
+			   cwt_R = 0
+-6301161171399331712 368232810553629414
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 4525501652075993915 -4959686242769919211
+			   cwt_L = 0
+			   cwt_R = 1
+root = CW reconstruction  = -7252764374167254247 5739828176680368191
+t[curlayer][0] 1
+CW reconstruction  = -2456022676870330044 -1907173758612498330
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -3819394960044050762 593183849756989047
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -9077204822343288836 -3455168465609490502
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 6842259862688790635 -8549440673305664837
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -8632031367124025977 7603420969189570615
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6139289106911615722 5809901092902830746
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7596273567520062365 -974092418002596676
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5497114317768809317 -8661367164627693410
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -7070987558120284154 -1099931929772746150
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2367036512505867824 5299325163353017345
+			   cwt_L = 0
+			   cwt_R = 0
+root = 8075744706865868605 -8816928983452602757
+t[curlayer][0] 1
+CW reconstruction  = -3792976198772274362 1698871011528114433
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 128959945223434670 -3949124424736479116
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 3582423452126394845 -3700357098368425547
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 8205180591738942578 -7785329013424496929
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -2090489738783498788 540450259860303607
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -8053465502487163790 -6243831973386108064
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 6365652239971190354 3299159852882774010
+3225659589143015771
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -6007434122465346141 5682077147123371299
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 4098716496166078187 1109741669070174434
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5470783787882499621 -4358701229617339391
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6086187457457338939 -8357983557990771425
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5412172713645189096 -675516516824327983
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -1025109867715905083 -4507474435315298883
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 250980295060630797 2736359890378634384
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 
+			   cwt_R = 0
+CW reconstruction  = -1744244498165737107 2798317759327178812
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 7296868289817834779 5517380182503731939
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 3420053779681539517 7424735292837282444
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -928335018793038975 2609386852813480174
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1643363547586653030 5866378099750223074
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 7716278043519857468 3296933930344638071
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -3574830321886928634 -6942805856055279140
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 4953320053247902618 -1268220040144309879
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7923522264107698146 8264343873205066151
+			   cwt_L = 0
+			   cwt_R = 0
+-2705388864792924656root = -7896502826983272525 -8554902343793397112
+t[curlayer][0] 1
+2775870208962509071CW reconstruction  = -8363432580913261508 -2163299488963063227
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -1744244498165737107 2798317759327178812
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 7296868289817834779 5517380182503731939
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 3420053779681539517 7424735292837282444
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -928335018793038975 2609386852813480174
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1643363547586653030 5866378099750223074
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 7716278043519857468 -3489861957941221402 -159535414218683838
+t[curlayer][0] 0
+CW reconstruction  = -6801803254974212327 -9103561376014010052
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 8949826641483451685 -559284238709439773
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1014624371352078000 3827535929174451638
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -6427401898458027716 -2703920856263120088
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 2596499203150696315 -8483668137565805276
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6646172029889890855 -7419406847962696657
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2376664064172552256 -3281286659424186770
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7986940719182193633 6494368967036718207
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3008460935632950853 8240806697790188937
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 1552576370961190513 6965336240519309229
+			   cwt_L = 1
+			   cwt_R = 1
+ root = -8634794673332806005 -3316790448615434679
+t[curlayer][0] 1
+CW reconstruction  = -6801803254974212327 -9103561376014010052
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 8949826641483451685 -559284238709439773
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1014624371352078000 3827535929174451638
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -6427401898458027716 -2703920856263120088
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 2596499203150696315 -8483668137565805276
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6646172029889890855 -7419406847962696657
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2376664064172552256 -3281286659424186770
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7986940719182193633 6494368967036718207
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3008460935632950853 8240806697790188937
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 1552576370961190513 6965336240519309229
+			   cwt_L = 1
+			   cwt_R = 1
+3296933930344638071
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 148373904173200391 8230015953900235175
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 1346651498178374273 5713914707641249525
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 7827775133343907430 -7152690008696530205
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7189998955654082441 -160963904632126243
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 2636792909517383388 6576874602714213798
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7323581263708995971 -4798692061711260238
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6672591861347369868 2253928456511352184
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 7966939631099430072 -5988907370988875829
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5161656527577933702 -1881972992725612818
+			   cwt_L = 1
+			   cwt_R = 0
+-3574830321886928634root = -493910664996503227 -866608082559133766
+t[curlayer][0] 1
+CW reconstruction  = -2899844322123127050 7207715151810147454
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 148373904173200391 8230015953900235175
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 1346651498178374273 5713914707641249525
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 7827775133343907430 -7152690008696530205
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7189998955654082441 -160963904632126243
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 2636792909517383388 6576874602714213798
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7323581263708995971 -4798692061711260238
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6672591861347369868 2253928456511352184
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 7966939631099430072 -5988907370988875829
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5161656527577933702 -1881972992725612818
+			   cwt_L = 1
+			   cwt_R = 0
+ 4732831133295537267
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2698497068057433429 -4219982742163285804
+			   cwt_L = 1
+			   cwt_R = 1
+ root = 3661949572089924527 2522676853118427647
+ t[curlayer][0] 1
+CW reconstruction  = -8000282392858898516
+t[curlayer][0] 0
+CW reconstruction  = -8470018715887284396 -5615247596592455116
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7404969555614678711 -8866503479636782339
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 4046374169745258722 8675118906381919290
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -693786035752254383 2218504278938938185
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3507151211637493826 4344887291795460074
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -8529799066930533795 -2713565413061403674
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 4717921396710937798 -7010239758487009713
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 1725756095950059960 6279104382273819339
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 8690777729968613018 -1316491571423211968
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 165075728161891514 -8415474016117630012
+			   cwt_L = 0
+			   cwt_R = 0
+-6942805856055279140root = -5252367585800368877 5166708746013449920
+t[curlayer][0] 1
+CW reconstruction  = -8470018715887284396 -5615247596592455116
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 7404969555614678711 -8866503479636782339
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 4046374169745258722 8675118906381919290
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -693786035752254383 2218504278938938185
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -3507151211637493826 4344887291795460074
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -8529799066930533795 -2713565413061403674
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 4717921396710937798 -7010239758487009713
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 1725756095950059960 6279104382273819339
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 8690777729968613018 -1316491571423211968
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 165075728161891514 -8415474016117630012
+			   cwt_L = 0
+			   cwt_R = 0
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -8170608238218318967523004862765125575 2078573986257932543
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -6857993168414977639 -6510128578683193671
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 8083723636189578387 -2280114371125429031
+			   cwt_L = 0
+			   cwt_R = 1
+
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 4953320053247902618 -1268220040144309879
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -7923522264107698146 8264343873205066151
+			   cwt_L = 0
+			   cwt_R = 0
+-3650034873080725342 3225659589143015771
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = -6007434122465346141 5682077147123371299
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 4098716496166078187 1109741669070174434
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5470783787882499621 -4358701229617339391
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = 6086187457457338939 -8357983557990771425
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 5412172713645189096 -675516516824327983
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = -1025109867715905083 
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -5005507974735064329 -9144350769671191349
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1838910849099357697 3632333775533137681
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5195447490499629153 -2001861800199077070
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 4737377856730234073 2689362822397372155
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2845757610367680204 1568090060440902415
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 4523538924258342410 -4057703426032203480
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 1228041384822006688 3662955478572306573
+			   cwt_L = 0
+			   cwt_R = 0
+-4507474435315298883root = 5242267123542039545 -4830608578772962327
+t[curlayer][0] 1
+CW reconstruction  = -6301161171399331712 368232810553629414
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 4525501652075993915 -4959686242769919211
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 2775870208962509071 -8170608238218318967
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -5005507974735064329 -9144350769671191349
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -1838910849099357697 3632333775533137681
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -5195447490499629153 -2001861800199077070
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 4737377856730234073 2689362822397372155
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2845757610367680204 1568090060440902415
+			   cwt_L = 1
+			   cwt_R = 0
+CW reconstruction  = 4523538924258342410 -4057703426032203480
+			   cwt_L = 0
+			   cwt_R = 0
+CW reconstruction  = 1228041384822006688 3662955478572306573
+			   cwt_L = 0
+			   cwt_R = 0
+
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = 250980295060630797 2736359890378634384
+			   cwt_L = 1
+			   cwt_R = 1
+CW reconstruction  = -2705388864792924656 4732831133295537267
+			   cwt_L = 0
+			   cwt_R = 1
+CW reconstruction  = -2698497068057433429 -4219982742163285804
+			   cwt_L = 1
+			   cwt_R = 1
+x0 = 11718120596791141791
+x1 = 4380980724745564993
+gamma0 = 17667659931862504714

preprocessing/mpc.h

@@ -0,0 +1,48 @@
+
+
+void du_attalah_P2(std::vector<socket_t>& sockets0, std::vector<socket_t>& sockets1, int socket_no = 0)
+{
+int64_t X0, X1, Y0, Y1,  gamma0, gamma1;
+
+     arc4random_buf(&X0, sizeof(int64_t));
+     arc4random_buf(&Y0, sizeof(int64_t));
+     arc4random_buf(&X1, sizeof(int64_t));
+     arc4random_buf(&Y1, sizeof(int64_t));
+
+    gamma0 = X0 * Y1;
+    gamma1 = X1 * Y0;
+    
+ 
+
+    boost::asio::write(sockets0[socket_no], boost::asio::buffer(&X0, sizeof(X0)));
+    boost::asio::write(sockets1[socket_no], boost::asio::buffer(&X1, sizeof(X1)));
+    
+    boost::asio::write(sockets0[socket_no], boost::asio::buffer(&Y0, sizeof(Y0)));
+    boost::asio::write(sockets1[socket_no], boost::asio::buffer(&Y1, sizeof(Y1)));
+    
+    boost::asio::write(sockets0[socket_no], boost::asio::buffer(&gamma0, sizeof(gamma0)));
+    boost::asio::write(sockets1[socket_no], boost::asio::buffer(&gamma1, sizeof(gamma1)));
+}
+
+int64_t du_attalah_Pb(int64_t rb, int64_t pm, tcp::socket& s2, tcp::socket& sb)
+{
+    int64_t gamma;
+	int64_t X, Y;
+    int64_t rb_blinded, pm_blinded, pm_blinded_recv, rb_blinded_recv;
+	boost::asio::read(s2, boost::asio::buffer(&X, sizeof(X)));
+	boost::asio::read(s2, boost::asio::buffer(&Y, sizeof(Y)));
+	boost::asio::read(s2, boost::asio::buffer(&gamma, sizeof(gamma)));
+ 
+
+	rb_blinded = rb + X;
+	pm_blinded = pm + Y;
+	boost::asio::write(sb, boost::asio::buffer(&rb_blinded, sizeof(rb_blinded)));
+	boost::asio::read(sb, boost::asio::buffer(&rb_blinded_recv, sizeof(rb_blinded_recv)));
+	
+	boost::asio::write(sb, boost::asio::buffer(&pm_blinded, sizeof(pm_blinded)));
+	boost::asio::read(sb, boost::asio::buffer(&pm_blinded_recv, sizeof(pm_blinded_recv)));
+	
+	int64_t rb_prime = rb * (pm + (pm_blinded_recv)) - (Y * rb_blinded_recv) + gamma; 
+
+    return rb_prime;
+}

preprocessing/network.h

@@ -0,0 +1,91 @@
+ #include <boost/asio.hpp>
+
+using boost::asio::ip::tcp;
+
+ 
+
+#include <mutex>
+#include <boost/lexical_cast.hpp>
+ 
+
+using socket_t = boost::asio::ip::tcp::socket;
+ 
+ void accept_conncections_from_Pb(boost::asio::io_context&io_context, std::vector<socket_t>& socketsPb, int port, size_t j)
+{
+ 	 tcp::acceptor acceptor_a(io_context, tcp::endpoint(tcp::v4(), port));
+	 tcp::socket sb_a(acceptor_a.accept());
+	 socketsPb[j] = std::move(sb_a); 
+}
+
+
+void make_connections(bool& party, const std::string host1, 
+								 const std::string host2, boost::asio::io_context&io_context,  std::vector<socket_t>& socketsPb, std::vector<socket_t>& socketsP2, 	std::vector<int> ports, std::vector<int> ports2_1,	std::vector<int> ports2_0, size_t number_of_sockets)
+{
+	    tcp::resolver resolver(io_context);
+
+		for(size_t j = 0; j < number_of_sockets + 1; ++j)
+ 	{
+ 		tcp::socket emptysocket(io_context);
+ 		socketsPb.emplace_back(std::move(emptysocket));
+ 	}
+	
+	socketsPb.reserve(number_of_sockets + 1);
+
+	for(size_t j = 0; j < number_of_sockets; ++j) 
+	{
+		int port = 6000;
+		ports.push_back(port + j);
+	}
+	
+
+	for(size_t j = 0; j < number_of_sockets; ++j) 
+	{
+		int port = 20000;
+		ports2_0.push_back(port + j);
+	}
+
+
+	for(size_t j = 0; j < number_of_sockets; ++j) 
+	{
+		int port = 40000;
+		ports2_1.push_back(port + j);
+	}
+
+
+	#if (PARTY == 0)    
+		
+		party = false;
+		for(size_t j = 0; j < number_of_sockets; ++j)
+		{
+		tcp::socket sb_a(io_context);
+		boost::asio::connect(sb_a, resolver.resolve({host2, std::to_string(ports2_0[j])}));
+		socketsP2.emplace_back(std::move(sb_a)); 
+		}
+	
+		for(size_t j = 0; j < number_of_sockets; ++j)
+		{
+		tcp::socket sb_a(io_context);
+		boost::asio::connect(sb_a, resolver.resolve({host1, std::to_string(ports[j])}));
+		socketsPb[j] = std::move(sb_a); 
+		}
+
+	#else	
+		party = true;	
+
+		for(size_t j = 0; j < number_of_sockets; ++j)
+		{
+		tcp::socket sb_a(io_context);
+		boost::asio::connect(sb_a, resolver.resolve({host2, std::to_string(ports2_1[j])}));
+		socketsP2.emplace_back(std::move(sb_a)); 
+		}
+	
+		boost::asio::thread_pool pool_connections(number_of_sockets); 
+	
+		for(size_t j = 0; j < number_of_sockets; ++j)
+		{
+		boost::asio::post(pool_connections, std::bind(accept_conncections_from_Pb,  std::ref(io_context), std::ref(socketsPb), ports[j],  j));
+		}
+	
+	pool_connections.join();
+	#endif
+}

preprocessing/p2preprocessing.cpp

@@ -0,0 +1,237 @@
+#include <type_traits>  // std::is_same<>
+#include <limits>       // std::numeric_limits<>
+#include <climits>      // CHAR_BIT
+#include <cmath>        // std::log2, std::ceil, std::floor
+#include <stdexcept>    // std::runtime_error
+#include <array>        // std::array<>
+#include <iostream>     // std::istream and std::ostream
+#include <vector>       // std::vector<>
+#include <memory>       // std::shared_ptr<>
+#include <utility>      // std::move
+#include <algorithm>    // std::copy
+#include <cstring>      // std::memcpy
+#include <bsd/stdlib.h> // arc4random_buf
+#include <x86intrin.h>  // SSE and AVX intrinsics
+#include <../boost/asio/thread_pool.hpp>
+#include "bitutils.h"
+#include "block.h"
+#include "prg_aes_impl.h" 
+#include <iostream>
+#include "block.h"
+#include <chrono>
+#include <sys/mman.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <fstream>
+#include <boost/asio.hpp>
+#include <mutex>
+#include <boost/lexical_cast.hpp>
+
+
+using boost::asio::ip::tcp;
+
+using namespace dpf;
+ 
+
+typedef __m128i leaf_type;
+ 
+ 
+typedef __m128i leaf_t;
+typedef __m128i node_t;
+ 
+ 
+
+ using socket_t = boost::asio::ip::tcp::socket;
+ 
+ 
+
+size_t bits_per_leaf = std::is_same<leaf_t, bool>::value ? 1 : sizeof(leaf_t) * CHAR_BIT;
+bool is_packed = (sizeof(leaf_t) < sizeof(node_t));
+size_t leaves_per_node = is_packed ? sizeof(node_t) * CHAR_BIT / bits_per_leaf : 1;
+size_t __depth(const size_t nitems) { return std::ceil(std::log2(std::ceil(static_cast<double>(nitems) / leaves_per_node))); }
+
+#include "mpc.h"
+#include "dpfgen.h"
+#include "share-conversion.h"
+
+void convert_sharesP2(std::vector<socket_t>& sockets0, std::vector<socket_t>& sockets1, size_t socket_no = 0)
+{ 
+  du_attalah_P2(sockets0, sockets1, socket_no); 
+} 
+
+void mpc_gen(const size_t depth, AES_KEY& prgkey, const size_t db_nitems, const size_t n_threads, std::vector<socket_t>& sockets0, std::vector<socket_t>& sockets1, 
+             __m128i** output0, int8_t ** flags0, __m128i* final_correction_word0,  __m128i** output1, int8_t ** flags1, __m128i* final_correction_word1, 
+            size_t socket_no = 0)
+{	
+	dpfP2 dpf_instance0, dpf_instance1;
+  
+  for(size_t j = 0; j < depth; ++j)
+  {
+   
+      __m128i rand0, rand1, gamma0, gamma1;
+
+      arc4random_buf(&rand0, sizeof(__m128i));
+      arc4random_buf(&rand1, sizeof(__m128i));
+      uint8_t bit0, bit1; 
+      bit0 = rand();
+      bit0 = bit0 % 2;
+      bit1 = rand();
+      bit1 = bit1 %2;
+
+      gamma0 = (bit1 == 1) ? rand0 : _mm_setzero_si128();
+      gamma1 = (bit0 == 1) ? rand1 : _mm_setzero_si128();
+
+      struct cw_construction
+      {
+        __m128i rand_b, gamma_b;
+        uint8_t bit_b;
+      };
+      
+      cw_construction computecw0, computecw1;
+      
+      computecw0.rand_b   = rand0;
+      computecw0.gamma_b  = gamma0;
+      computecw0.bit_b    = bit0;
+
+      computecw1.rand_b   = rand1;
+      computecw1.gamma_b  = gamma1;
+      computecw1.bit_b    = bit1;
+      
+      boost::asio::write(sockets0[socket_no], boost::asio::buffer(&computecw0, sizeof(computecw0)));
+      boost::asio::write(sockets1[socket_no], boost::asio::buffer(&computecw1, sizeof(computecw1)));
+
+
+      #ifdef DEBUG
+        boost::asio::write(sockets0[socket_no], boost::asio::buffer(&rand0, sizeof(rand0)));
+        boost::asio::write(sockets0[socket_no], boost::asio::buffer(&gamma0, sizeof(gamma0)));
+        boost::asio::write(sockets0[socket_no], boost::asio::buffer(&bit0, sizeof(bit0)));
+
+        boost::asio::write(sockets1[socket_no], boost::asio::buffer(&rand1, sizeof(rand1)));
+        boost::asio::write(sockets1[socket_no], boost::asio::buffer(&gamma1, sizeof(gamma1)));
+        boost::asio::write(sockets1[socket_no], boost::asio::buffer(&bit1, sizeof(bit1)));
+      #endif
+
+  } 
+  
+  boost::asio::read(sockets0[socket_no+1], boost::asio::buffer(&dpf_instance0, sizeof(dpfP2)));
+  boost::asio::read(sockets1[socket_no+1], boost::asio::buffer(&dpf_instance1, sizeof(dpfP2)));
+ 
+
+  evaluate_dpfs(db_nitems,  dpf_instance0,   prgkey,  0, db_nitems-1,	output0[0],  flags0[0],  final_correction_word0[0], false,  0);
+  evaluate_dpfs(db_nitems,  dpf_instance1,   prgkey,  0, db_nitems-1, output1[0], flags1[0], final_correction_word1[0], true,  0);
+
+  #ifdef DEBUG
+    for(size_t j = 0; j < db_nitems; ++j)
+    {
+    
+      std::cout << j << "-> "  << (int) flags[0][j] << " <-> " << (int) flags1[0][j] << std::endl;
+      std::cout << j << "-> " << output[0][j][0] << " <-> " << output1[0][j][0] << std::endl << std::endl;
+    }
+  #endif
+}
+ 
+void accept_conncections_from_Pb(boost::asio::io_context&io_context, std::vector<socket_t>& sockets0, int port, size_t j)
+{
+  tcp::acceptor acceptor2_(io_context, tcp::endpoint(tcp::v4(), port));
+  tcp::socket s2(acceptor2_.accept());
+  sockets0[j] = std::move(s2);
+}
+int main(int argc, char* argv[])
+{ 
+  
+  AES_KEY aeskey;
+  boost::asio::io_context io_context;
+  tcp::resolver resolver(io_context);
+   
+  const std::string host0 = (argc < 2) ? "127.0.0.1" : argv[1];
+  const std::string host1 = (argc < 3) ? "127.0.0.1" : argv[2];
+   
+  const size_t n_threads = atoi(argv[3]);
+  const size_t number_of_sockets = 5 * n_threads;
+       
+   
+  const size_t nitems2 = 1ULL << atoi(argv[4]);
+  const size_t db_nitems = 1ULL << atoi(argv[4]);
+  const size_t depth = std::ceil(std::log2(nitems2));
+
+    
+  std::vector<int> ports2_0;
+  for(size_t j = 0; j < number_of_sockets; ++j) 
+  {
+    int port = 20000;
+    ports2_0.push_back(port + j);
+  }
+
+  std::vector<int> ports2_1;
+  for(size_t j = 0; j < number_of_sockets; ++j) 
+  {
+    int port = 40000;
+    ports2_1.push_back(port + j);
+  }
+
+
+  std::vector<socket_t> sockets0;
+  std::vector<socket_t> sockets1;
+  sockets0.reserve(number_of_sockets + 1);
+  sockets1.reserve(number_of_sockets + 1);
+
+  boost::asio::thread_pool pool2(number_of_sockets * 2); 
+  for(size_t j = 0; j < number_of_sockets; ++j)
+  {
+    boost::asio::post(pool2, std::bind(accept_conncections_from_Pb,  std::ref(io_context), std::ref(sockets1), ports2_1[j],  j));
+  }
+
+  
+  for(size_t j = 0; j < number_of_sockets; ++j)
+  {
+    boost::asio::post(pool2, std::bind(accept_conncections_from_Pb,  std::ref(io_context), std::ref(sockets0), ports2_0[j],  j));
+  }
+
+  pool2.join();
+
+  boost::asio::thread_pool pool(n_threads); 
+  __m128i * final_correction_word0 = (__m128i *) std::aligned_alloc(sizeof(__m256i), n_threads * sizeof(__m128i));
+	__m128i ** output0 = (__m128i ** ) malloc(sizeof(__m128i *) * n_threads);
+	int8_t  ** flags0  = (int8_t ** ) malloc(sizeof(uint8_t *) * n_threads);
+	 
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		output0[j] = (__m128i *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(__m128i));
+		flags0[j]  = (int8_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(uint8_t));
+	}
+
+
+  __m128i * final_correction_word1 = (__m128i *) std::aligned_alloc(sizeof(__m256i), n_threads * sizeof(__m128i));
+	__m128i ** output1 = (__m128i ** ) malloc(sizeof(__m128i *) * n_threads);
+	int8_t  ** flags1  = (int8_t ** ) malloc(sizeof(uint8_t *) * n_threads);
+	 
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		output1[j] = (__m128i *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(__m128i));
+		flags1[j]  = (int8_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(uint8_t));
+	}
+  for(size_t j = 0; j < n_threads; ++j)
+  {
+     boost::asio::post(pool, std::bind(mpc_gen,  std::ref(depth), std::ref(aeskey), db_nitems, n_threads,  std::ref(sockets0), std::ref(sockets1), 
+                        output0, flags0, final_correction_word0,  output1, flags1, final_correction_word1, 5 * j));    
+  }
+
+  pool.join();
+
+
+  boost::asio::thread_pool pool3(n_threads); 
+
+  for(size_t j = 0; j < n_threads; ++j)
+  {
+     boost::asio::post(pool3, std::bind(convert_sharesP2, std::ref(sockets0), std::ref(sockets1), j));    
+  }
+
+  pool3.join(); 
+  
+  P2_xor_to_additive(sockets0, sockets1, 0);
+  
+  return 0;
+}
+
+ 
+ 

preprocessing/preprocessing.cpp

@@ -0,0 +1,156 @@
+#include <type_traits>  // std::is_same<>
+#include <limits>       // std::numeric_limits<>
+#include <climits>      // CHAR_BIT
+#include <cmath>        // std::log2, std::ceil, std::floor
+#include <stdexcept>    // std::runtime_error
+#include <array>        // std::array<>
+#include <iostream>     // std::istream and std::ostream
+#include <vector>       // std::vector<>
+#include <memory>       // std::shared_ptr<>
+#include <utility>      // std::move
+#include <algorithm>    // std::copy
+#include <cstring>      // std::memcpy
+#include <bsd/stdlib.h> // arc4random_buf
+#include <x86intrin.h>  // SSE and AVX intrinsics
+#include <../boost/asio/thread_pool.hpp>
+#include "bitutils.h"
+#include "block.h" 
+#include "prg_aes_impl.h"
+#include <iostream>
+#include <fcntl.h>
+#include <cstdlib>
+#include "block.h"
+#include <chrono>
+#include <sys/mman.h>
+#include <sys/stat.h>
+#include <fcntl.h>
+#include <fstream>
+#include <future>
+#include <boost/asio.hpp>
+using boost::asio::ip::tcp;
+
+#include <mutex>
+#include <boost/lexical_cast.hpp>
+ 
+using socket_t = boost::asio::ip::tcp::socket;
+ 
+typedef unsigned char byte_t;
+
+typedef __m128i node_t;
+constexpr size_t leaf_size = 1;
+typedef __m128i leaf_type;
+
+typedef std::array<leaf_type, leaf_size> leaf_t;
+
+using namespace dpf;  // The namespace is found in bitutils.h
+
+#include "mpc.h"
+
+#include "network.h"
+
+#include "dpfgen.h"
+#include "share-conversion.h"
+int main(int argc, char * argv[])
+{ 	
+	
+	boost::asio::io_context io_context;
+	std::string addr = "127.0.0.1";
+	
+	const std::string host1 = (argc < 2) ? "127.0.0.1" : argv[1];
+	const std::string host2 = (argc < 3) ? "127.0.0.1" : argv[2];
+	const size_t n_threads = atoi(argv[3]);
+	const size_t expo = atoi(argv[4]);
+	const size_t number_of_sockets = 5 * n_threads;
+
+	std::vector<socket_t> socketsPb, socketsP2;
+	std::vector<int> ports, ports2_1, ports2_0;
+ 
+  	bool party;
+
+	make_connections(party, host1, host2,  io_context, socketsPb, socketsP2, ports,  ports2_1, ports2_0, number_of_sockets);
+ 
+	const size_t db_nitems = 1ULL << atoi(argv[4]);
+
+ 	auto start = std::chrono::steady_clock::now(); 
+	
+	uint8_t ** target_share_read = new uint8_t*[n_threads];
+
+	generate_random_targets(target_share_read,  n_threads, party, expo);
+	
+	AES_KEY aeskey;
+
+	__m128i * final_correction_word = (__m128i *) std::aligned_alloc(sizeof(__m256i), n_threads * sizeof(__m128i));
+	__m128i ** output = (__m128i ** ) malloc(sizeof(__m128i *) * n_threads);
+	int8_t  ** flags  = (int8_t ** ) malloc(sizeof(uint8_t *) * n_threads);
+	 
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		output[j] = (__m128i *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(__m128i));
+		flags[j]  = (int8_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(uint8_t));
+	}
+	 
+	boost::asio::thread_pool pool(n_threads);
+	boost::asio::thread_pool pool_share_conversion(n_threads);
+	
+	int64_t ** leaves = (int64_t ** ) malloc(sizeof(int64_t *) * n_threads);
+	int64_t ** leafbits  = (int64_t ** ) malloc(sizeof(int64_t *) * n_threads);
+	 
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		leaves[j] = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+		leafbits[j]  = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+	}
+	
+	// The following function call creates and evaluates DPFs at target_share_read[j] for j \in \{0, \ldots, n_threads}
+	// the flag vectors are stored in flags
+	// the leaves are stored in output
+	// the final correctionword is stored in final_correction_word
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		boost::asio::post(pool,  std::bind(create_dpfs,  db_nitems,	std::ref(aeskey),  target_share_read[j],  std::ref(socketsPb), std::ref(socketsP2), 0, db_nitems-1, 
+						  output[j],  flags[j], std::ref(final_correction_word[j]),  party, 5 * j, j));	 	  
+	}
+	pool.join();  
+
+	//#ifdef DEBUG
+		for(size_t j = 0; j < n_threads; ++j)
+		{
+			for(size_t i = 0; i < db_nitems; ++i)
+			{
+				int8_t flags_reconstruction;
+				boost::asio::write(socketsPb[0], boost::asio::buffer(&flags[j][i], sizeof(flags[j][i])));
+				boost::asio::read(socketsPb[0], boost::asio::buffer(&flags_reconstruction, sizeof(flags_reconstruction)));
+				flags_reconstruction -= flags[j][i];
+				if(flags_reconstruction != 0) std::cout << i << " ---> " << (int) flags_reconstruction << std::endl;
+
+				int64_t output_reconstruction;
+				boost::asio::write(socketsPb[0], boost::asio::buffer(&output[j][i][0], sizeof(output[j][i][0])));
+				boost::asio::read(socketsPb[0], boost::asio::buffer(&output_reconstruction, sizeof(output_reconstruction)));
+				output_reconstruction -= output[j][i][0];
+				if(output_reconstruction != 0) std::cout << i << "---> " << output_reconstruction << std::endl;
+			}
+			int64_t final_correction_word_reconstruction = 0;
+			boost::asio::write(socketsPb[0], boost::asio::buffer(&final_correction_word[j][0], sizeof(final_correction_word[j][0])));
+			boost::asio::read(socketsPb[0], boost::asio::buffer(&final_correction_word_reconstruction, sizeof(final_correction_word_reconstruction)));
+			final_correction_word_reconstruction = final_correction_word_reconstruction + final_correction_word[j][0];
+			std::cout << "final_correction_word_reconstruction = " << final_correction_word_reconstruction << std::endl << std::endl;
+		}
+	//#endif
+ 
+
+	for(size_t j = 0; j < n_threads; ++j)
+	{
+		boost::asio::post(pool_share_conversion,  std::bind(convert_shares, j, output, flags, n_threads, db_nitems, final_correction_word, 	leaves, leafbits, 
+												  std::ref(socketsPb[j]), std::ref(socketsP2[j]), party ));	 	
+	}
+	
+	pool_share_conversion.join();
+
+ 	xor_to_additive( party, target_share_read, socketsPb, socketsP2);
+
+	auto end = std::chrono::steady_clock::now();
+	std::chrono::duration<double> elapsed_seconds = end-start;
+	std::cout << "time to generate and evaluate " << n_threads << " dpfs of size 2^" << atoi(argv[4]) << " is: " << elapsed_seconds.count() << "s\n";
+
+	return 0;
+}

preprocessing/prg.h

@@ -0,0 +1,20 @@
+/* Copyright (C) 2019  Anonymous
+ *
+ * This is a pre-release version of the DPF++ library distributed anonymously
+ * for peer review. A public release of the software will be published under the
+ * LPGL v2.1 license in the near future. Please do not redistribute this version
+ * of the software.
+ */
+
+#ifndef DPFPP_PRG_H__
+#define DPFPP_PRG_H__
+ 
+namespace dpf
+{
+
+template<typename node_t, typename lowmc>
+inline void PRG(const lowmc & prgkey, const node_t & seed, void * outbuf, const uint32_t len, const uint32_t from = 0);
+ 
+
+} // namespace dpf
+#endif // DPFPP_PRG_H

preprocessing/prg_aes_impl.h

@@ -0,0 +1,73 @@
+/* Copyright (C) 2019  Anonymous
+ *
+ * This is a pre-release version of the DPF++ library distributed anonymously
+ * for peer review. A public release of the software will be published under the
+ * LPGL v2.1 license in the near future. Please do not redistribute this version
+ * of the software.
+ */
+
+#ifndef DPFPP_PRG_AES_IMPL_H__
+#define DPFPP_PRG_AES_IMPL_H__
+
+#include "prg.h"
+#include "aes.h"
+
+namespace dpf
+{
+
+template<>
+inline void PRG(const AES_KEY & prgkey, const __m128i & seed, void * outbuf, const uint32_t len, const uint32_t from)
+{
+ 
+	__m128i * outbuf128 = reinterpret_cast<__m128i *>(outbuf);
+	for (size_t i = 0; i < len; ++i)
+	{
+		outbuf128[i] = _mm_xor_si128(seed, _mm_set_epi64x(0, from+i));
+	}
+	AES_ecb_encrypt_blks(outbuf128, static_cast<unsigned int>(len), &prgkey);
+	for (size_t i = 0; i < len; ++i) 
+	{
+		outbuf128[i] = _mm_xor_si128(outbuf128[i], _mm_set_epi64x(0, from+i));
+		outbuf128[i] = _mm_xor_si128(outbuf128[i], seed);
+	}
+} // PRG<AES_KEY>
+inline void PRG_aes(const AES_KEY & prgkey, const __m128i & seed, void * outbuf, const uint32_t len, const uint32_t from = 0)
+{
+	__m128i * outbuf128 = reinterpret_cast<__m128i *>(outbuf);
+	for (size_t i = 0; i < len; ++i)
+	{
+		outbuf128[i] = _mm_xor_si128(seed, _mm_set_epi64x(0, from+i));
+	}
+	AES_ecb_encrypt_blks(outbuf128, static_cast<unsigned int>(len), &prgkey);
+	for (size_t i = 0; i < len; ++i) 
+	{
+		outbuf128[i] = _mm_xor_si128(outbuf128[i], _mm_set_epi64x(0, from+i));
+		outbuf128[i] = _mm_xor_si128(outbuf128[i], seed);
+	}
+} // PRG<AES_KEY>
+
+
+inline void PRG_aes(const AES_KEY & prgkey, const __m256i & seed, void * outbuf, const uint32_t len, const uint32_t from = 0)
+{
+	 __m256i * outbuf256 = reinterpret_cast<__m256i *>(outbuf);
+	 for (size_t i = 0; i < len; ++i)
+	 {
+	 	outbuf256[i] = _mm256_xor_si256(seed, _mm256_set_epi64x(0, 0, 0, from+i));
+	 }
+	
+	// AES_ecb_encrypt_blks(reinterpret_cast<__m128i *>(outbuf256), static_cast<unsigned int>(len), &prgkey);
+	
+	 for (size_t i = 0; i < len; ++i) 
+	 {
+		outbuf256[i] = _mm256_xor_si256(outbuf256[i], _mm256_set_epi64x(0, 0, 0, from+i));
+		outbuf256[i] = _mm256_xor_si256(outbuf256[i], seed);
+	 }
+} // PRG<AES_KEY>
+inline std::ostream & operator<<(std::ostream & os, const AES_KEY & prgkey)
+{
+	return os.write(reinterpret_cast<const char *>(&prgkey.rd_key[0]), sizeof(__m128i));
+} // operator<<
+
+} // namespace dpf
+
+#endif // DPFPP_PRG_AES_IMPL_H

preprocessing/share-conversion.h

@@ -0,0 +1,331 @@
+uint64_t binary_to_decimal(std::array<uint64_t, 64> inp)
+{
+
+	uint64_t output = 0;		
+	for(size_t j = 0; j < 64; ++j)
+	{
+		output += (1ULL << j) * inp[j];
+	}
+
+	return output;
+}
+
+void  P2_xor_to_additive(std::vector<socket_t>& sockets0, std::vector<socket_t>& sockets1, size_t socket_no)
+{
+   uint64_t x0, x1, y0, y1, gamma0, gamma1, alpha;
+
+   arc4random_buf(&x0, sizeof(uint64_t));
+   arc4random_buf(&x1, sizeof(uint64_t));
+   arc4random_buf(&y0, sizeof(uint64_t));
+   arc4random_buf(&y1, sizeof(uint64_t));
+   arc4random_buf(&alpha, sizeof(uint64_t));
+
+ 
+   gamma0 = (x0 * y1) - alpha;
+   gamma1 =  alpha;
+
+
+  std::cout << "x0 = " << x0 << std::endl;
+  std::cout << "x1 = " << x1 << std::endl;
+  std::cout << "gamma0 = " << gamma0 << std::endl;
+  boost::asio::write(sockets0[socket_no], boost::asio::buffer(&x0, sizeof(x0)));
+ 
+  boost::asio::write(sockets0[socket_no], boost::asio::buffer(&gamma0, sizeof(gamma0)));
+
+  boost::asio::write(sockets1[socket_no], boost::asio::buffer(&y1, sizeof(y1)));
+  boost::asio::write(sockets1[socket_no], boost::asio::buffer(&gamma1, sizeof(gamma1)));
+
+}
+
+int64_t xor_to_additive(bool party, uint8_t ** target_share_read, std::vector<socket_t>& socketsPb, std::vector<socket_t>& socketsP2)
+{
+    const size_t logn = 64;
+
+    
+    std::array<uint64_t, logn> b;
+    std::array<uint64_t, logn> b_blinded;
+    std::array<uint64_t, logn> b_recv;
+    
+    for(size_t j = 0; j < logn; ++j)
+    {
+        // arc4random_buf(&b[j], sizeof(b[j]));
+        // b[j] = b[j] % 2;	
+        b[j] = target_share_read[0][j];
+        #ifdef DEBUG
+            uint8_t target_bit_rec;   
+            boost::asio::write(socketsPb[0], boost::asio::buffer(&target_share_read[0][j],   sizeof(uint8_t)));
+            boost::asio::read(socketsPb[0], boost::asio::buffer(&target_bit_rec,   sizeof(uint8_t)));
+            if(target_bit_rec != target_share_read[0][j]) std::cout << "XOR---->>>> " << j << std::endl;
+        #endif
+    }
+
+    #ifdef DEBUG
+        uint64_t b_ = binary_to_decimal(b);
+        std::cout << "b_ = " << b_ << std::endl;
+    #endif
+    //std::array<uint64_t, logn> c;
+
+
+    std::array<uint64_t, logn> c_mul;
+    std::array<uint64_t, logn> d;
+   
+
+
+    
+
+    boost::asio::write(socketsPb[0], boost::asio::buffer(&b, logn * sizeof(b[0])));
+    boost::asio::read(socketsPb[0], boost::asio::buffer(&b_recv, logn * sizeof(b[0])));
+
+
+
+    uint64_t BLIND, Gamma;
+    boost::asio::read(socketsP2[0], boost::asio::buffer(&BLIND, sizeof(uint64_t)));
+    boost::asio::read(socketsP2[0], boost::asio::buffer(&Gamma, sizeof(uint64_t)));
+
+
+    for(size_t j = 0; j < logn; ++j)
+    {
+        b_blinded[j] = b[j] + BLIND;
+    }
+
+    //for(size_t j = 0; j < logn; ++j)
+    {
+        boost::asio::write(socketsPb[0], boost::asio::buffer(&b_blinded, logn * sizeof(b_blinded[0])));
+        boost::asio::read (socketsPb[0], boost::asio::buffer(&b_recv,  logn * sizeof(b_recv[0])));
+    }
+    
+    #ifdef DEBUG
+        std::cout << "BLIND = " << BLIND << std::endl;
+        std::cout << "Gamma = " << Gamma << std::endl;
+    #endif
+    
+    if(!party) 
+    {
+            for(size_t j = 0; j < logn; ++j) 
+            {
+                    #ifdef DEBUG
+                        if(j ==  0)
+                        {
+                            std::cout << "b_recv[j] = " << b_recv[j] << std::endl;
+                            std::cout << "b[j] = " << b[j] << std::endl;
+                        }
+                    #endif
+                    c_mul[j] =  (b[j] * b_recv[j]) + Gamma;
+            }
+    }
+
+    if(party)  
+    {
+        for(size_t j = 0; j < logn; ++j) 
+        {       
+            #ifdef DEBUG
+                if(j ==  0)
+                    {
+                        std::cout << "BLIND = " << BLIND << std::endl;
+                        std::cout << "b_blinded[j] = " << b_blinded[j] << std::endl;
+                    }
+            #endif
+            c_mul[j] = -(BLIND * b_recv[j]) + Gamma;
+        }
+    }
+
+    #ifdef DEBUG
+        for(size_t j = 0; j < 1; ++j)
+        {
+        
+            std::cout << "b = " << b[j] << std::endl;
+            
+            uint64_t mul_Rec = 0;
+            boost::asio::write(socketsPb[0], boost::asio::buffer(&c_mul[j], sizeof(c_mul[j])));
+            boost::asio::read(socketsPb[0], boost::asio::buffer(&mul_Rec, sizeof(mul_Rec)));
+            std::cout << "c_mul = " << c_mul[j] << std::endl;
+            mul_Rec = mul_Rec + c_mul[j];
+
+            std::cout << "mul_Rec = " << mul_Rec << std::endl;
+        }
+    #endif
+
+    
+
+    for(size_t j = 0; j < logn; ++j)
+    {
+        d[j] = (b[j] - 2 * c_mul[j]);
+
+    }
+
+    
+
+    #ifdef DEBUG
+            std::array<uint64_t, logn> b_reconstruction_;
+            std::array<uint64_t, logn> d_reconstruction_;
+             std::array<uint64_t, logn> d_recv;
+            for(size_t j = 0; j < logn; ++j)
+            {
+                boost::asio::write(socketsPb[0], boost::asio::buffer(&d[j], sizeof(d[j])));
+                boost::asio::read(socketsPb[0], boost::asio::buffer(&d_recv[j], sizeof(d_recv[j])));
+            }
+
+                boost::asio::write(socketsPb[0], boost::asio::buffer(&b, logn * sizeof(b[0])));
+                boost::asio::read (socketsPb[0], boost::asio::buffer(&b_recv,  logn * sizeof(b_recv[0])));
+
+                for(size_t j = 0; j < logn; ++j)
+                {
+                    uint64_t d_reconstruction = d[j] + d_recv[j];
+                    d_reconstruction_[j] = d_reconstruction;
+                    uint64_t b_reconstruction = b[j] ^ b_recv[j];
+                    b_reconstruction_[j] = b_reconstruction;
+                    assert(d_reconstruction == b_reconstruction);
+                    //std::cout << d_reconstruction << " <----> " << d[j] << std::endl;
+                    //std::cout << d_reconstruction << " <-> " << b_reconstruction << std::endl;
+                }
+        
+        uint64_t b_value =	binary_to_decimal(b_reconstruction_);
+        std::cout << "b_value = " << b_value << std::endl;
+        std::cout << "logn = " << logn << std::endl;
+    #endif
+   
+
+    uint64_t R_share = 0;
+
+    for(size_t j = 0; j < logn; ++j)
+    {
+        R_share += (1ULL << j) * d[j];
+    }
+
+
+    #ifdef DEBUG
+        std::cout << "R_share = " << R_share << std::endl;
+        R_share = binary_to_decimal(d);
+        std::cout << "R_share = " << R_share << std::endl;
+        uint64_t R_share_reconstruction;
+        boost::asio::write(socketsPb[0], boost::asio::buffer(&R_share, sizeof(R_share)));
+        boost::asio::read(socketsPb[0], boost::asio::buffer(&R_share_reconstruction, sizeof(R_share_reconstruction)));
+        R_share_reconstruction = R_share_reconstruction + R_share;
+        std::cout << "R_share_reconstruction = " << R_share_reconstruction << std::endl;
+        std::cout << "b_value                = " << b_value << std::endl;
+        std::cout << "d_recons		 = " << binary_to_decimal(d_reconstruction_)<< std::endl;
+    #endif
+
+        return R_share;
+}
+
+
+void convert_shares(size_t i, __m128i ** output, int8_t ** flags, size_t n_threads, size_t db_nitems, __m128i * final_correction_word, 
+					int64_t ** leaves, int64_t ** leafbits,
+					tcp::socket& sb, tcp::socket& s2, bool party)
+{
+	
+	#ifdef DEBUG
+		std::cout << "share conversion " << i << "-th, thread started runing" << std::endl << std::endl;
+	#endif
+
+	for(size_t j = 0; j < db_nitems; ++j)
+	{
+		if(party)
+		{
+			output[i][j] = -output[i][j];
+			flags[i][j]  =  -flags[i][j]; 
+		}
+	}
+
+	int64_t pm = 0;
+	int64_t rb;
+
+	arc4random_buf(&rb, sizeof(rb));
+
+	for(size_t j = 0; j < db_nitems; ++j)
+	{
+		if(party)
+		{
+		  if(flags[i][j] != 0)	pm -= 1;
+		}
+		if(!party)
+		{
+		 if(flags[i][j] != 0)	pm += 1; 
+		}
+	}
+
+	//int64_t rb_prime = du_attalah_Pb(rb, pm, s2, sb);
+
+	int64_t FCWshare = du_attalah_Pb(final_correction_word[i][1], pm, s2, sb);
+
+ 
+	
+    FCWshare+=rb;
+	int64_t FCWshare_reconstruction;
+ 	boost::asio::write(sb, boost::asio::buffer(&FCWshare, sizeof(FCWshare)));
+	boost::asio::read(sb, boost::asio::buffer(&FCWshare_reconstruction, sizeof(FCWshare_reconstruction)));
+	FCWshare_reconstruction = FCWshare_reconstruction + FCWshare;
+
+ 
+	
+	int64_t PM = pm + rb;
+	int64_t PM_recv;
+
+	boost::asio::write(sb, boost::asio::buffer(&PM, sizeof(PM)));
+	boost::asio::read(sb, boost::asio::buffer(&PM_recv, sizeof(PM_recv)));
+    
+    int64_t * flags_  = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+	int64_t * outs_  = (int64_t *)std::aligned_alloc(sizeof(node_t), db_nitems * sizeof(int64_t));
+	
+	for(size_t j = 0; j < db_nitems; ++j)
+	{
+		outs_[j] = output[0][j][0];
+		leaves[i][j] = output[i][j][0];
+
+		#ifdef DEBUG
+			int64_t out_rec;
+			boost::asio::write(sb, boost::asio::buffer(&outs_[j], sizeof(outs_[j])));
+			boost::asio::read(sb, boost::asio::buffer(&out_rec, sizeof(out_rec)));
+			out_rec = out_rec + outs_[j];
+
+			if(out_rec != 0) std::cout << j << "-> " << out_rec << std::endl;
+		#endif
+
+		flags_[j] = (flags[i][j] * pm) + (flags[i][j] * PM_recv) + (flags[i][j] * rb); 
+ 
+		flags_[j] += output[i][j][1]; 
+
+		if(!party)
+		{	
+			flags_[j] -= (flags[i][j] * FCWshare_reconstruction);		
+		}
+		if(party)
+		{ 
+			flags_[j] -= (flags[i][j] * FCWshare_reconstruction);
+		}
+	
+		#ifdef DEBUG
+		int64_t flags_rec;
+		boost::asio::write(sb, boost::asio::buffer(&flags_[j], sizeof(flags_[j])));
+		boost::asio::read(sb, boost::asio::buffer(&flags_rec, sizeof(flags_rec)));
+		flags_rec = flags_rec + flags_[j];
+
+		if(flags_rec != 0)
+		{
+			 std::cout << j << " ---> Flag Reconstruction = " << flags_rec << std::endl;
+		}
+		#endif
+		
+ 
+		flags[i][j] = flags_[j];
+		
+		if(flags[i][j] == 128 || flags[i][j] == -128) flags[i][j] = 0;
+		leafbits[i][j] = flags[i][j];
+		
+		#ifdef DEBUG
+			int8_t flags_rec2;
+			boost::asio::write(sb, boost::asio::buffer(&flags[i][j], sizeof(flags[i][j])));
+			boost::asio::read(sb, boost::asio::buffer(&flags_rec2, sizeof(flags_rec2)));
+			flags_rec2 = flags_rec2 + flags[i][j];
+
+			if(flags_rec2 != 0)
+			{
+				std::cout << j << " ---> Flag Reconstruction = " << (int) flags_rec2 << std::endl;
+				if(flags_rec2 != 1) std::cout << (int) flags[i][j]  << "-> " << flags_[j] << std::endl;
+			}
+		#endif
+	}
+
+	 write_evalfull_outs_into_a_file(party, i, db_nitems, flags,  leaves[0], final_correction_word); 
+}