solver.h

/* Copyright (c) 2020 tevador <tevador@gmail.com> */
/* See LICENSE for licensing information */
 
#ifndef SOLVER_H
#define SOLVER_H
 
#include <equix.h>
#include <hashx_endian.h>
#include <stdbool.h>
#include "context.h"
 
#define EQUIX_STAGE1_MASK ((1ull << 15) - 1)
#define EQUIX_STAGE2_MASK ((1ull << 30) - 1)
#define EQUIX_FULL_MASK ((1ull << 60) - 1)
 
static inline bool tree_cmp1(const equix_idx* left, const equix_idx* right) {
        return *left <= *right;
}
 
static inline uint32_t tree_idx2(const equix_idx* idx) {
        return
                (uint32_t)idx[1] << 1*16 |
                (uint32_t)idx[0] << 0*16;
}
 
static inline bool tree_cmp2(const equix_idx* left, const equix_idx* right) {
        return tree_idx2(left) <= tree_idx2(right);
}
 
static inline uint64_t tree_idx4(const equix_idx* idx) {
        return
                (uint64_t)idx[3] << 3*16 |
                (uint64_t)idx[2] << 2*16 |
                (uint64_t)idx[1] << 1*16 |
                (uint64_t)idx[0] << 0*16;
}
 
static inline bool tree_cmp4(const equix_idx* left, const equix_idx* right) {
        return tree_idx4(left) <= tree_idx4(right);
}
 
EQUIX_PRIVATE int equix_solver_solve(hashx_ctx* hash_func, solver_heap* heap, equix_solution output[EQUIX_MAX_SOLS]);
 
#endif