name string | code string | asm string | file string |
|---|---|---|---|
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::maximize_tag>::insert(baryonyx::itm::local_context&, baryonyx::bit_array const&, unsigned long, double, double, long) | void insert(local_context& ctx,
const bit_array& x,
const std::size_t hash,
const double value,
const double duration,
const long int loop) noexcept
{
to_log(stdout,
5u,
"- insert solution {} (hash:... | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq 0x59f188(%rip), %r12 # 0x63cfc8
movq %rdi, %rbx
leaq 0x20(%rsp), %r9
leaq 0x18(%rsp), %rax
leaq 0x10(%rsp), %r10
leaq 0x8(%rsp), %r11
movq %rdx, %r14
movq %rsi, %r15
movq %rcx, (%r9)
vmovsd %xmm0, (%rax)
vmovsd %xmm1, (%r10)
movq %r8, (%r11)
movq (%r1... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::maximize_tag>::can_be_inserted(unsigned long, int) const | bool can_be_inserted(const std::size_t hash, const int constraints) const
noexcept
{
m_indices_reader lock(m_indices_mutex);
for (int i = 0; i != m_size; ++i)
if (m_data[i].remaining_constraints == constraints &&
m_data[i].hash == hash)
return false... | pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq %rdi, (%rsp)
movl %edx, %ebx
movq %rsi, %r14
movq %rdi, %r15
movb $0x1, 0x8(%rsp)
callq 0x3c460
movl 0x98(%r15), %eax
movq 0x50(%r15), %rcx
xorl %edx, %edx
imulq $0x38, %rax, %rax
cmpq %rdx, %rax
je 0x9dff6
cmpl %ebx, 0x30(%rcx,%rdx)
jne 0x9dff0
cmpq %r14, 0x20(%rc... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::maximize_tag>::get_best(int&, double&, double&, long&) const | void get_best(int& constraints_remaining,
double& value,
double& duration,
long int& loop) const noexcept
{
m_indices_reader lock(m_indices_mutex);
int id = m_indices.front();
constraints_remaining = m_data[id].remaining_constraints;
... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rdi, (%rsp)
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r12
movq %rdi, %r13
movb $0x1, 0x8(%rsp)
callq 0x3c460
movq 0x38(%r13), %rax
movq 0x50(%r13), %rcx
movq %rsp, %rdi
movslq (%rax), %rax
imulq $0x38, %rax, %rax
movl 0x30(%r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::file_observer>::store_if_better(baryonyx::bit_... | inline bool
is_better_solution(Float lhs, Float rhs) noexcept
{
if constexpr (std::is_same_v<Mode, minimize_tag>)
return lhs < rhs;
else
return lhs > rhs;
} | vucomisd 0x30(%rdi), %xmm0
jbe 0xa0cc4
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xa0d3e
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
pop... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::file_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x3b8d59(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>(baryonyx::context const&, baryonyx::problem ... | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x130, %rsp # imm = 0x130
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0xa14ce
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x3527e
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups ... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::storage(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::default_cost_type<long double> const&, double, int, int, std::vector<baryonyx::itm::merged_constraint, std::allocator<ba... | storage(random_engine& rng,
const Cost& costs_,
const double cost_constant_,
const int population_size,
const int variables,
const std::vector<merged_constraint>& constraints_)
: m_indices(population_size)
, m_data(population_size)
, m_baster... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, 0x18(%rsp)
movq %rdi, %r15
movslq %ecx, %r12
leaq 0x58(%rsp), %rdx
movq %rsi, %r13
movq %r9, 0x28(%rsp)
movl %r8d, %ebp
movl %ecx, %ebx
vmovupd %ymm0, 0x18(%rdi)
vmovupd %ymm... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
void baryonyx::itm::init_with_bastert<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::itm::default_cost_type<long double> const&, int, int) | void
init_with_bastert(bit_array& x,
const Cost& c,
const int variables,
const int value_if_0) noexcept
{
for (int i = 0; i != variables; ++i)
if (init_x<Mode>(c[i], value_if_0))
x.set(i);
else
x.unset(i);
} | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %edx, %r13d
shlq $0x4, %r13
movl %ecx, %ebx
movq %rsi, %r14
movq %rdi, %r15
xorl %r12d, %r12d
xorl %ebp, %ebp
cmpq %rbp, %r13
je 0xa1dae
movq 0x8(%r14), %rcx
testl %ebx, %ebx
setne %al
fldt (%rcx,%rbp)
fldz
fucomi %st(1), %st
setnp %dl
se... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::sort() | void sort() noexcept
{
m_indices_writer lock{ m_indices_mutex };
std::sort(
std::begin(m_indices), std::end(m_indices), [this](int i1, int i2) {
const int cst_1 = this->m_data[i1].remaining_constraints;
const int cst_2 = this->m_data[i2].remaining_constraints;
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %rbx
leaq 0x8(%rsp), %rdi
movq %rbx, %rsi
callq 0x377e6
movq 0x38(%rbx), %rdi
movq 0x40(%rbx), %rsi
movq %rbx, %rdx
callq 0xa2bbd
movq 0x59af1f(%rip), %r13 # 0x63cfc8
movq (%r13), %rdi
leaq 0x3b7fe4(%rip), %rcx # 0x45a09... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x1e8, %rsp # imm = 0x1E8
movq %rdi, %rbp
leaq 0x58(%rsp), %rdi
movq %rsi, %r15
movl %r8d, %esi
vmovsd %xmm0, 0x88(%rsp)
movq %r9, %r12
movl %r8d, %ebx
movq %rcx, %r14
movq %rdx, 0x68(%rsp)
callq 0x368ae
movq (%rbp), %r13
movq %rbp, 0xb0... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::solver_random_inequalities_101coeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::default_cost_type<long double> const&, st... | solver_random_inequalities_101coeff(
random_engine& rng_,
int m_,
int n_,
const cost_type& c_,
const std::vector<merged_constraint>& csts)
: rng(rng_)
, ap(csts, m_, n_)
, A(std::make_unique<int[]>(ap.size()))
, R(std::make_unique<rc_data[]>(compute_reduced_costs_ve... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
leaq 0x8(%rdi), %r13
movq %rsi, (%rdi)
movq %rdi, %r15
movq %r9, %r12
movq %r8, 0x20(%rsp)
movl %edx, %r14d
movq %r9, %rsi
movl %ecx, 0x4(%rsp)
movq %r13, %rdi
callq 0x3a4ca
movl 0x30(%r15), %esi
leaq 0x48(%r15), %rbx
movq %rbx, %rdi
mov... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::reinit(baryonyx::itm::local_context&, bool, double, double, baryonyx::bit_array&) | double reinit(local_context& ctx,
const bool /*is_solution*/,
const double kappa_min,
const double kappa_max,
bit_array& x)
{
to_log(stdout, 3u, "- reinitinialization thread {}.\n", ctx.thread_id);
double kappa = kappa_min;
... | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq 0x5992b4(%rip), %r12 # 0x63cfc8
movq %rdi, %r15
movq %rcx, %rbx
leaq 0x3b663a(%rip), %rcx # 0x45a35b
vmovsd %xmm1, 0x8(%rsp)
vmovsd %xmm0, 0x10(%rsp)
movq %rsi, %r14
leaq 0xa0(%rsi), %r8
movq (%r12), %rdi
pushq $0x3
popq %rsi
pushq $0x20
popq %rdx
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_co... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0xa3e18
movq %rax, %rdi
jmp 0xa496a
cmpl $0x7, %ecx
jne 0xa3e35
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0xa3e43
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0xa3e26
movq %rsi, %rdi
movq %rdx, %rsi
movq %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::run<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array, long double>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm:... | int run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta)
{
bool pi_changed = false;
int remaining = 0;
switch (order) {
case solver_parameters::constraint_order::reversing:
so... | pushq %r15
pushq %r14
pushq %rbx
subq $0x70, %rsp
fldt 0xb0(%rsp)
fldt 0xa0(%rsp)
fldt 0x90(%rsp)
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0xa3f65
leaq 0x3b5f18(%rip), %rdx # 0x459d98
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::try_update(baryonyx::itm::local_context&, baryonyx::bit_array const&, double, long) | void try_update(local_context& ctx,
const bit_array& solution,
const double value,
const long int loop)
{
auto hash = bit_array_hash()(solution);
if (m_storage.can_be_inserted(hash, value)) {
const auto end = std::chrono::stead... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %r13
leaq 0xf(%rsp), %rdi
movq %rsi, %r15
movq %rdx, %rsi
movq %rcx, %rbx
vmovsd %xmm0, 0x10(%rsp)
movq %rdx, %r14
callq 0x3775a
vmovsd 0x10(%rsp), %xmm0
leaq 0x8(%r13), %rbp
movq %rax, %r12
movq %rax, %rsi
movq %rbp, %rdi
cal... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::try_advance(baryonyx::itm::local_context&, baryonyx::bit_array const&, int, long) | void try_advance(local_context& ctx,
const bit_array& solution,
const int remaining_constraints,
const long int loop)
{
auto hash = bit_array_hash()(solution);
if (m_storage.can_be_inserted(hash, remaining_constraints)) {
co... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %r13
leaq 0xf(%rsp), %rdi
movq %rsi, %r15
movq %rdx, %rsi
movq %r8, 0x10(%rsp)
movl %ecx, %ebp
movq %rdx, %r14
callq 0x3775a
leaq 0x8(%r13), %rbx
movq %rax, %r12
movq %rax, %rsi
movl %ebp, %edx
movq %rbx, %rdi
callq 0xa7bc8
te... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array, long double>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryo... | int push_and_run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta,
Float objective_amplifier)
{
bool pi_changed = 0;
int remaining = 0;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x80, %rsp
fldt 0xd0(%rsp)
fldt 0xc0(%rsp)
fldt 0xb0(%rsp)
fldt 0xa0(%rsp)
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0xa41c9
xorl %esi, %esi
leal 0x1(%rax), %edx
cmpl $0x7, %eax
cmovll %edx, %esi
movl %esi, %eax
movl %esi, 0x30... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::mutation(baryonyx::itm::local_context&, baryonyx::bit_array&) | void mutation(local_context& ctx, bit_array& x)
{
if (ctx.value_p_dist.mean() == 0.0 && ctx.value_p_dist.stddev() == 0.0)
return;
double val_p, var_p;
do
var_p = ctx.variable_p_dist(ctx.rng);
while (var_p <= 0.0 || var_p >= 1.0);
do
val_... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
vmovsd 0x48(%rsi), %xmm0
vxorpd %xmm1, %xmm1, %xmm1
movq %rdx, %rbx
movq %rsi, %r14
vucomisd %xmm1, %xmm0
jne 0xa4558
jp 0xa4558
vmovsd 0x50(%r14), %xmm0
vucomisd %xmm1, %xmm0
jne 0xa4558
jp 0xa4558
addq $0x28, %rsp
popq %rbx
popq %r12
p... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::crossover(baryonyx::itm::local_context&, baryonyx::bit_array&) | void crossover(local_context& ctx, bit_array& x)
{
m_indices_reader lock(m_indices_mutex);
if (ctx.crossover_bastert_insertion(ctx.rng)) {
int first = m_indices[choose_a_solution(ctx)];
std::bernoulli_distribution b(0.5);
if (b(ctx.rng)) {
if (b(... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x20, %rsp
movq %rdi, 0x10(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
movb $0x1, 0x18(%rsp)
callq 0x3c460
leaq 0x80(%r15), %rdi
movq %r15, %rsi
callq 0x36254
testb %al, %al
je 0xa4725
movq %rbx, %rdi
movq %r15, %rsi
callq 0xa48a4
movq 0x38(%rbx), %... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::crossover(baryonyx::itm::local_context&, baryonyx::bit_array&, baryonyx::bit_array const&, baryonyx::bit_array const&) | void crossover(local_context& ctx,
bit_array& x,
const bit_array& first,
const bit_array& second)
{
const auto block_size = x.block_size();
for (int i = 0; i != block_size; ++i) {
const auto x1 = first.block(i);
const a... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl 0x4(%rdx), %r15d
leaq 0x70(%rsi), %r13
movq %r8, 0x10(%rsp)
movq %rcx, 0x8(%rsp)
movq %rsi, %r12
xorl %ebp, %ebp
movq %rdx, (%rsp)
cmpq %rbp, %r15
je 0xa495b
movq 0x8(%rsp), %rdi
movl %ebp, %esi
callq 0x377b0
movq 0x10(%rsp), %rdi
m... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>> const, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryo... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0xa498c
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x8(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x80(%r15), %eax
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::de... | int
compute_violated_constraints(const Solver& slv,
const Xtype& x,
std::vector<int>& out)
{
out.clear();
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
out.emplace_back(k);
return length(out);
} | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq (%rdx), %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
cmpq %rax, 0x8(%rdx)
je 0xa4a8a
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x80(%r15), %esi
je 0xa4ac0
movq %r15, %rdi
movq %r14, %rdx
callq 0xa4ad7
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_co... | bool
is_valid_constraint(const Solver& slv, int k, const Xtype& x)
{
typename sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = slv.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += slv.factor(it->value) * x[it->column];
return slv.bound_min(k) <= v && v <= slv.bound_max(k... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdx, %r14
movl %esi, %edx
leaq 0x8(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdi, %rbx
movl %edx, 0x4(%rsp)
movq %r15, %rdi
callq 0x3c868
movq (%r15), %r12
movq 0x8(%r15), %r13
xorl %r15d, %r15d
cmpq %r12, %r13
je 0xa4b34
movslq (%r13... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::compute_update_row<baryonyx::bit_array, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>>(baryonyx::bit_array&, std::rev... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constrai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x90(%rsp)
movq %rsi, 0x18(%rsp)
leaq 0x8(%rdi), %r14
leaq 0x70(%rsp), %r15
movq %rdi, %r12
fldt 0x110(%rsp)
fstpt 0xac(%rsp)
fldt 0x100(%rsp)
fstpt 0x50(%rsp)
fldt 0xf0(%rsp)
fld1
fsub %st(1), %st
fdivrp %st, %st(1)
fstpt 0x4... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, st... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constrai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x88(%rsp)
movq %rsi, 0x18(%rsp)
leaq 0x8(%rdi), %r14
leaq 0x70(%rsp), %r15
movq %rdi, %r12
fldt 0x110(%rsp)
fstpt 0xac(%rsp)
fldt 0x100(%rsp)
fstpt 0x50(%rsp)
fldt 0xf0(%rsp)
fld1
fsub %st(1), %st
fdivrp %st, %st(1)
fstpt 0x4... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryo... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constrai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x88(%rsp)
movq %rsi, 0x18(%rsp)
leaq 0x8(%rdi), %r14
leaq 0x70(%rsp), %r15
movq %rdi, %r12
fldt 0x110(%rsp)
fstpt 0xac(%rsp)
fldt 0x100(%rsp)
fstpt 0x50(%rsp)
fldt 0xf0(%rsp)
fld1
fsub %st(1), %st
fdivrp %st, %st(1)
fstpt 0x4... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::i... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0xa58e8
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x8(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x80(%r15), %eax
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<in... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constrai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x88(%rsp)
movq %rsi, 0x18(%rsp)
leaq 0x8(%rdi), %r14
leaq 0x70(%rsp), %r15
movq %rdi, %r12
fldt 0x110(%rsp)
fstpt 0xac(%rsp)
fldt 0x100(%rsp)
fstpt 0x50(%rsp)
fldt 0xf0(%rsp)
fld1
fsub %st(1), %st
fdivrp %st, %st(1)
fstpt 0x4... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_t... | int local_compute_violated_constraints(const Solver& slv, const Xtype& x)
{
int remaining = 0;
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
++remaining;
return remaining;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
xorl %ebp, %ebp
xorl %r15d, %r15d
cmpl 0x80(%r14), %r15d
je 0xa5e6f
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0xa4ad7
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0xa5e4c
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::decrease_preference(baryonyx::sparse_matrix<int>::row_value*, baryonyx::sparse_matrix<int>::row_value*, long double) | void decrease_preference(sparse_matrix<int>::row_iterator begin,
sparse_matrix<int>::row_iterator end,
Float theta) noexcept
{
for (; begin != end; ++begin)
P[begin->value] *= theta;
} | fldt 0x8(%rsp)
movq 0x68(%rdi), %rax
cmpq %rdx, %rsi
je 0xa5e9e
movslq (%rsi), %rcx
addq $0x8, %rsi
shlq $0x4, %rcx
fldt (%rax,%rcx)
fmul %st(1), %st
fstpt (%rax,%rcx)
jmp 0xa5e84
fstp %st(0)
retq
| /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::stop_iterating<baryonyx::itm::minimize_tag, long double>(long double, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&) | inline bool
stop_iterating(Float value, random_engine& rng) noexcept
{
if (value == 0) {
std::bernoulli_distribution d(0.5);
return d(rng);
}
if constexpr (std::is_same_v<Mode, minimize_tag>)
return value > 0;
else
return value < 0;
} | pushq %rax
fldt 0x10(%rsp)
fldz
fxch %st(1)
fucompi %st(1), %st
fstp %st(0)
jne 0xa5ef6
jp 0xa5ef6
callq 0x36ac3
vmovsd 0x3b2a86(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
seta %al
popq %rcx
retq
movq %rax, %rdi
callq 0xeb9f
| /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>::rc_data*>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<l... | inline void
random_shuffle_unique(iteratorT begin,
iteratorT end,
random_engine& rng) noexcept
{
auto ret = begin++;
for (; begin != end; ++begin) {
if (ret->value != begin->value) {
std::shuffle(ret, begin, rng);
ret = begin;
}... | pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
leaq 0x20(%rdi), %r15
cmpq %r14, %r15
je 0xa5f3e
fldt (%rdi)
fldt (%r15)
addq $0x20, %r15
fxch %st(1)
fucompi %st(1), %st
fstp %st(0)
jne 0xa5f2a
jnp 0xa5f12
addq $-0x20, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0xa64bf
movq %r15, %rdi
jmp 0xa5f0e
movq ... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::can_be_inserted(unsigned long, double) const | bool can_be_inserted([[maybe_unused]] const std::size_t hash,
const double value) const noexcept
{
m_indices_reader lock(m_indices_mutex);
for (int i = 0; i != m_size; ++i)
if (m_data[i].remaining_constraints == 0 &&
m_data[i].value == value && m... | pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
vmovsd %xmm0, (%rsp)
movq %rsi, %rbx
movq %rdi, %r14
movb $0x1, 0x10(%rsp)
callq 0x3c460
movl 0x98(%r14), %eax
vmovsd (%rsp), %xmm1
movq 0x50(%r14), %rcx
xorl %edx, %edx
imulq $0x38, %rax, %rax
cmpq %rdx, %rax
je 0xa7a26
cmpl $0x0, 0x30(%rcx,%rdx)
jne 0xa7a20
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::insert(baryonyx::itm::local_context&, baryonyx::bit_array const&, unsigned long, double, double, long) | void insert(local_context& ctx,
const bit_array& x,
const std::size_t hash,
const double value,
const double duration,
const long int loop) noexcept
{
to_log(stdout,
5u,
"- insert solution {} (hash:... | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq 0x59556e(%rip), %r12 # 0x63cfc8
movq %rdi, %rbx
leaq 0x20(%rsp), %r9
leaq 0x18(%rsp), %rax
leaq 0x10(%rsp), %r10
leaq 0x8(%rsp), %r11
movq %rdx, %r14
movq %rsi, %r15
movq %rcx, (%r9)
vmovsd %xmm0, (%rax)
vmovsd %xmm1, (%r10)
movq %r8, (%r11)
movq (%r1... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::replace_result(int, baryonyx::bit_array const&, double, double, unsigned long, long, int) | void replace_result(const int id,
const bit_array& x,
const double value,
const double duration,
const std::size_t hash,
const long int loop,
const int remaining_constraints) n... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq %rdi, 0x18(%rsp)
movl %r9d, %ebx
movq %r8, %r14
movq %rcx, %r15
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
movq %rdx, %r13
movl %esi, %ebp
movq %rdi, %r12
movb $0x1, 0x20(%rsp)
callq 0x3c460
movq 0x50(%r12), %rdi
movslq %ebp, ... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::can_be_inserted(unsigned long, int) const | bool can_be_inserted(const std::size_t hash, const int constraints) const
noexcept
{
m_indices_reader lock(m_indices_mutex);
for (int i = 0; i != m_size; ++i)
if (m_data[i].remaining_constraints == constraints &&
m_data[i].hash == hash)
return false... | pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq %rdi, (%rsp)
movl %edx, %ebx
movq %rsi, %r14
movq %rdi, %r15
movb $0x1, 0x8(%rsp)
callq 0x3c460
movl 0x98(%r15), %eax
movq 0x50(%r15), %rcx
xorl %edx, %edx
imulq $0x38, %rax, %rax
cmpq %rdx, %rax
je 0xa7c10
cmpl %ebx, 0x30(%rcx,%rdx)
jne 0xa7c0a
cmpq %r14, 0x20(%rc... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::insert(baryonyx::itm::local_context&, baryonyx::bit_array const&, unsigned long, int, double, long) | void insert(local_context& ctx,
const bit_array& x,
const std::size_t hash,
const int remaining_constraints,
const double duration,
const long int loop) noexcept
{
to_log(stdout,
5u,
"- insert advan... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movq 0x595381(%rip), %r12 # 0x63cfc8
movq %rdi, %rbx
leaq 0x20(%rsp), %rax
leaq 0xc(%rsp), %r10
leaq 0x18(%rsp), %r11
leaq 0x10(%rsp), %r13
movq %rdx, %r14
movq %rsi, %r15
movq %rcx, (%rax)
movl %r8d, (%r10)
vmovsd %xmm0, (%r11)
movq ... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::get_best(int&, double&, double&, long&) const | void get_best(int& constraints_remaining,
double& value,
double& duration,
long int& loop) const noexcept
{
m_indices_reader lock(m_indices_mutex);
int id = m_indices.front();
constraints_remaining = m_data[id].remaining_constraints;
... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rdi, (%rsp)
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r12
movq %rdi, %r13
movb $0x1, 0x8(%rsp)
callq 0x3c460
movq 0x38(%r13), %rax
movq 0x50(%r13), %rcx
movq %rsp, %rdi
movslq (%rax), %rax
imulq $0x38, %rax, %rax
movl 0x30(%r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<long double>, baryonyx::itm::minimize_tag>::show_population(baryonyx::context const&) const | void show_population(const context& ctx) const
{
info(ctx, " Population {}:\n", m_indices.size());
for (int i = 0; i != m_size; ++i)
info(ctx,
" - {}: value {} constraints {} hash {}\n",
m_indices[i],
m_data[m_indices[i]].value,
... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq 0x40(%rdi), %rax
movq %rsi, %rbx
leaq 0x8(%rsp), %rdx
leaq 0x3b136b(%rip), %rsi # 0x45a53d
movq %rdi, %r14
subq 0x38(%rdi), %rax
movq %rbx, %rdi
sarq $0x2, %rax
movq %rax, (%rdx)
callq 0x41545
leaq 0x3b135f(%rip), %r15 # 0x45a54e
xorl %r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::file_observer>::operator()(std::vector<baryonyx::i... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x428, %rsp # imm = 0x428
vmovsd %xmm0, 0x80(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x58(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::pnm_observer>::store_if_better(baryonyx::bit_array... | void store_if_better(const bit_array& x, double current, long int i)
{
if (is_better_solution<Mode>(current, m_best.value)) {
m_best.x = x;
m_best.duration = duration();
m_best.loop = i;
m_best.remaining_constraints = 0;
m_best.value = current;
... | vmovsd 0x30(%rdi), %xmm1
vucomisd %xmm0, %xmm1
jbe 0xaa800
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xaa87a
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::file_observer>::store_if_better(baryonyx::bit_arra... | void store_if_better(const bit_array& x, double current, long int i)
{
if (is_better_solution<Mode>(current, m_best.value)) {
m_best.x = x;
m_best.duration = duration();
m_best.loop = i;
m_best.remaining_constraints = 0;
m_best.value = current;
... | vmovsd 0x30(%rdi), %xmm1
vucomisd %xmm0, %xmm1
jbe 0xaa8e6
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xaa960
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::file_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x3af137(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::none_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x3af051(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::optimize_problem<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>(baryonyx::context const&, baryonyx::p... | inline result
optimize_problem(const context& ctx, const problem& pb)
{
result r;
if (ctx.start)
ctx.start(ctx.parameters);
auto constraints{ make_merged_constraints(ctx, pb) };
if (constraints.empty() || pb.vars.values.empty()) {
r.status = result_status::success;
r.solutions.... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x198, %rsp # imm = 0x198
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, %r13
movq %rsi, %r15
movq %rdi, %r12
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>(baryonyx::context const&, baryonyx::prob... | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x140, %rsp # imm = 0x140
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0xab100
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x3527e
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups ... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::storage(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::quadratic_cost_type<long double> const&, double, int, int, std::vector<baryonyx::itm::merged_constraint, std::allocato... | storage(random_engine& rng,
const Cost& costs_,
const double cost_constant_,
const int population_size,
const int variables,
const std::vector<merged_constraint>& constraints_)
: m_indices(population_size)
, m_data(population_size)
, m_baster... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, 0x18(%rsp)
movq %rdi, %r15
movslq %ecx, %r12
leaq 0x58(%rsp), %rdx
movq %rsi, %r13
movq %r9, 0x28(%rsp)
movl %r8d, %ebp
movl %ecx, %ebx
vmovupd %ymm0, 0x18(%rdi)
vmovupd %ymm... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
void baryonyx::itm::init_with_bastert<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::itm::quadratic_cost_type<long double> const&, int, int) | void
init_with_bastert(bit_array& x,
const Cost& c,
const int variables,
const int value_if_0) noexcept
{
for (int i = 0; i != variables; ++i)
if (init_x<Mode>(c[i], value_if_0))
x.set(i);
else
x.unset(i);
} | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
movl %ecx, %ebx
movl %edx, %ebp
movq %rsi, %r14
movq %rdi, %r15
xorl %r12d, %r12d
cmpl %r12d, %ebp
je 0xab9df
testl %ebx, %ebx
movq %r14, %rdi
movl %r12d, %esi
setne %r13b
callq 0x9722e
fldz
fxch %st(1)
fucomi %st(1), %st
fxch %st(1)
setnp %cl... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::init_with_pre_solve<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::bit_array&, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::quadratic_cost_type<long double> const&, std::vector<baryonyx::itm... | void
init_with_pre_solve(bit_array& x_pessimistic,
bit_array& x_optimistic,
random_engine& rng,
const Cost& c,
const std::vector<merged_constraint>& constraints,
const double init_random) noexcept
{
int max_length = ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x30(%rsp)
movq (%r8), %rax
movq 0x8(%r8), %rcx
movq %rdx, %r12
vmovsd %xmm0, 0x48(%rsp)
movq %r8, %r13
xorl %edx, %edx
movq %rsi, 0x28(%rsp)
movq %rdi, 0x20(%rsp)
cmpq %rcx, %rax
je 0xaba3d
movq 0x8(%rax), %rsi
subq (%rax), %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::sort() | void sort() noexcept
{
m_indices_writer lock{ m_indices_mutex };
std::sort(
std::begin(m_indices), std::end(m_indices), [this](int i1, int i2) {
const int cst_1 = this->m_data[i1].remaining_constraints;
const int cst_2 = this->m_data[i2].remaining_constraints;
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %rbx
leaq 0x8(%rsp), %rdi
movq %rbx, %rsi
callq 0x377e6
movq 0x38(%rbx), %rdi
movq 0x40(%rbx), %rsi
movq %rbx, %rdx
callq 0xac7f7
movq 0x5912e5(%rip), %r13 # 0x63cfc8
movq (%r13), %rdi
leaq 0x3ae3aa(%rip), %rcx # 0x45a09... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>::operator()(std::atomic<bool> const&, baryonyx::itm::b... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x1f8, %rsp # imm = 0x1F8
movq %rdi, %rbp
leaq 0x58(%rsp), %rdi
movq %rsi, %r15
movl %r8d, %esi
vmovsd %xmm0, 0x88(%rsp)
movq %r9, %r12
movl %r8d, %ebx
movq %rcx, %r14
movq %rdx, 0x68(%rsp)
callq 0x368ae
movq (%rbp), %r13
movq %rbp, 0xb0... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>::solver_random_inequalities_101coeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::quadratic_cost_type<long double> const&... | solver_random_inequalities_101coeff(
random_engine& rng_,
int m_,
int n_,
const cost_type& c_,
const std::vector<merged_constraint>& csts)
: rng(rng_)
, ap(csts, m_, n_)
, A(std::make_unique<int[]>(ap.size()))
, R(std::make_unique<rc_data[]>(compute_reduced_costs_ve... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
leaq 0x8(%rdi), %r13
movq %rsi, (%rdi)
movq %rdi, %r15
movq %r9, %r12
movq %r8, 0x20(%rsp)
movl %edx, %r14d
movq %r9, %rsi
movl %ecx, 0x4(%rsp)
movq %r13, %rdi
callq 0x3a4ca
movl 0x30(%r15), %esi
leaq 0x48(%r15), %rbx
movq %rbx, %rdi
mov... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadrati... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0xada52
movq %rax, %rdi
jmp 0xae5a4
cmpl $0x7, %ecx
jne 0xada6f
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0xada7d
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0xada60
movq %rsi, %rdi
movq %rdx, %rsi
movq %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::run<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, baryonyx::bit_array, long double>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::it... | int run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta)
{
bool pi_changed = false;
int remaining = 0;
switch (order) {
case solver_parameters::constraint_order::reversing:
so... | pushq %r15
pushq %r14
pushq %rbx
subq $0x70, %rsp
fldt 0xb0(%rsp)
fldt 0xa0(%rsp)
fldt 0x90(%rsp)
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0xadb9f
leaq 0x3ac316(%rip), %rdx # 0x459dd0
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::quadratic_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::try_update(baryonyx::itm::local_context&, baryonyx::bit_array const&, double, long) | void try_update(local_context& ctx,
const bit_array& solution,
const double value,
const long int loop)
{
auto hash = bit_array_hash()(solution);
if (m_storage.can_be_inserted(hash, value)) {
const auto end = std::chrono::stead... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movq %rdi, %r13
leaq 0xf(%rsp), %rdi
movq %rsi, %r15
movq %rdx, %rsi
movq %rcx, %rbx
vmovsd %xmm0, 0x10(%rsp)
movq %rdx, %r14
callq 0x3775a
vmovsd 0x10(%rsp), %xmm0
leaq 0x8(%r13), %rbp
movq %rax, %r12
movq %rax, %rsi
movq %rbp, %rdi
cal... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::quadratic_cost_type<long double>, long double, baryonyx::itm::minimize_tag>::mutation(baryonyx::itm::local_context&, baryonyx::bit_array&) | void mutation(local_context& ctx, bit_array& x)
{
if (ctx.value_p_dist.mean() == 0.0 && ctx.value_p_dist.stddev() == 0.0)
return;
double val_p, var_p;
do
var_p = ctx.variable_p_dist(ctx.rng);
while (var_p <= 0.0 || var_p >= 1.0);
do
val_... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
vmovsd 0x48(%rsi), %xmm0
vxorpd %xmm1, %xmm1, %xmm1
movq %rdx, %rbx
movq %rsi, %r14
vucomisd %xmm1, %xmm0
jne 0xae192
jp 0xae192
vmovsd 0x50(%r14), %xmm0
vucomisd %xmm1, %xmm0
jne 0xae192
jp 0xae192
addq $0x28, %rsp
popq %rbx
popq %r12
p... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::crossover(baryonyx::itm::local_context&, baryonyx::bit_array&) | void crossover(local_context& ctx, bit_array& x)
{
m_indices_reader lock(m_indices_mutex);
if (ctx.crossover_bastert_insertion(ctx.rng)) {
int first = m_indices[choose_a_solution(ctx)];
std::bernoulli_distribution b(0.5);
if (b(ctx.rng)) {
if (b(... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x20, %rsp
movq %rdi, 0x10(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %rbx
movb $0x1, 0x18(%rsp)
callq 0x3c460
leaq 0x80(%r15), %rdi
movq %r15, %rsi
callq 0x36254
testb %al, %al
je 0xae35f
movq %rbx, %rdi
movq %r15, %rsi
callq 0xae4de
movq 0x38(%rbx), %... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::crossover(baryonyx::itm::local_context&, baryonyx::bit_array&, baryonyx::bit_array const&, baryonyx::bit_array const&) | void crossover(local_context& ctx,
bit_array& x,
const bit_array& first,
const bit_array& second)
{
const auto block_size = x.block_size();
for (int i = 0; i != block_size; ++i) {
const auto x1 = first.block(i);
const a... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
movl 0x4(%rdx), %r15d
leaq 0x70(%rsi), %r13
movq %r8, 0x10(%rsp)
movq %rcx, 0x8(%rsp)
movq %rsi, %r12
xorl %ebp, %ebp
movq %rdx, (%rsp)
cmpq %rbp, %r15
je 0xae595
movq 0x8(%rsp), %rdi
movl %ebp, %esi
callq 0x377b0
movq 0x10(%rsp), %rdi
m... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
int baryonyx::itm::compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::... | int
compute_violated_constraints(const Solver& slv,
const Xtype& x,
std::vector<int>& out)
{
out.clear();
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
out.emplace_back(k);
return length(out);
} | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq (%rdx), %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
cmpq %rax, 0x8(%rdx)
je 0xae6c4
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x80(%r15), %esi
je 0xae6fa
movq %r15, %rdi
movq %r14, %rdx
callq 0xae711
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx:... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0xaf562
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x8(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x80(%r15), %eax
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constrai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x80(%rsp)
leaq 0x8(%rdi), %r15
movq %rsi, %r13
movq %rdi, %r12
fldt 0x110(%rsp)
fstpt 0xac(%rsp)
fldt 0x100(%rsp)
fstpt 0x50(%rsp)
fldt 0xf0(%rsp)
fld1
fsub %st(1), %st
fdivrp %st, %st(1)
fstpt 0x44(%rsp)
movq %rdi, 0x28(%rsp... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize... | int local_compute_violated_constraints(const Solver& slv, const Xtype& x)
{
int remaining = 0;
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
++remaining;
return remaining;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
xorl %ebp, %ebp
xorl %r15d, %r15d
cmpl 0x80(%r14), %r15d
je 0xafaff
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0xae711
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0xafadc
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>::decrease_preference(baryonyx::sparse_matrix<int>::row_value*, baryonyx::sparse_matrix<int>::row_value*, long double) | void decrease_preference(sparse_matrix<int>::row_iterator begin,
sparse_matrix<int>::row_iterator end,
Float theta) noexcept
{
for (; begin != end; ++begin)
P[begin->value] *= theta;
} | fldt 0x8(%rsp)
movq 0x68(%rdi), %rax
cmpq %rdx, %rsi
je 0xafb2e
movslq (%rsi), %rcx
addq $0x8, %rsi
shlq $0x4, %rcx
fldt (%rax,%rcx)
fmul %st(1), %st
fstpt (%rax,%rcx)
jmp 0xafb14
fstp %st(0)
retq
| /quesnel[P]baryonyx/lib/src/random-solver.cpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::can_be_inserted(unsigned long, double) const | bool can_be_inserted([[maybe_unused]] const std::size_t hash,
const double value) const noexcept
{
m_indices_reader lock(m_indices_mutex);
for (int i = 0; i != m_size; ++i)
if (m_data[i].remaining_constraints == 0 &&
m_data[i].value == value && m... | pushq %r14
pushq %rbx
subq $0x18, %rsp
movq %rdi, 0x8(%rsp)
vmovsd %xmm0, (%rsp)
movq %rsi, %rbx
movq %rdi, %r14
movb $0x1, 0x10(%rsp)
callq 0x3c460
movl 0x98(%r14), %eax
vmovsd (%rsp), %xmm1
movq 0x50(%r14), %rcx
xorl %edx, %edx
imulq $0x38, %rax, %rax
cmpq %rdx, %rax
je 0xb1686
cmpl $0x0, 0x30(%rcx,%rdx)
jne 0xb1680
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::get_best(int&, double&, double&, long&) const | void get_best(int& constraints_remaining,
double& value,
double& duration,
long int& loop) const noexcept
{
m_indices_reader lock(m_indices_mutex);
int id = m_indices.front();
constraints_remaining = m_data[id].remaining_constraints;
... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq %rdi, (%rsp)
movq %r8, %rbx
movq %rcx, %r14
movq %rdx, %r15
movq %rsi, %r12
movq %rdi, %r13
movb $0x1, 0x8(%rsp)
callq 0x3c460
movq 0x38(%r13), %rax
movq 0x50(%r13), %rcx
movq %rsp, %rdi
movslq (%rax), %rax
imulq $0x38, %rax, %rax
movl 0x30(%r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<long double>, baryonyx::itm::minimize_tag>::show_population(baryonyx::context const&) const | void show_population(const context& ctx) const
{
info(ctx, " Population {}:\n", m_indices.size());
for (int i = 0; i != m_size; ++i)
info(ctx,
" - {}: value {} constraints {} hash {}\n",
m_indices[i],
m_data[m_indices[i]].value,
... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x10, %rsp
movq 0x40(%rdi), %rax
movq %rsi, %rbx
leaq 0x8(%rsp), %rdx
leaq 0x3a770b(%rip), %rsi # 0x45a53d
movq %rdi, %r14
subq 0x38(%rdi), %rax
movq %rbx, %rdi
sarq $0x2, %rax
movq %rax, (%rdx)
callq 0x41545
leaq 0x3a76ff(%rip), %r15 # 0x45a54e
xorl %r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::pnm_observer>::operator()(std::vector<baryonyx... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x438, %rsp # imm = 0x438
vmovsd %xmm0, 0x80(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x58(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::file_observer>::operator()(std::vector<baryony... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x438, %rsp # imm = 0x438
vmovsd %xmm0, 0x80(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x58(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::file_observer>::store_if_better(baryonyx::bit_... | void store_if_better(const bit_array& x, double current, long int i)
{
if (is_better_solution<Mode>(current, m_best.value)) {
m_best.x = x;
m_best.duration = duration();
m_best.loop = i;
m_best.remaining_constraints = 0;
m_best.value = current;
... | vmovsd 0x30(%rdi), %xmm1
vucomisd %xmm0, %xmm1
jbe 0xb4546
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xb45c0
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<long double>, baryonyx::file_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x3a54d7(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::debug_logger<true>::debug_logger(std::basic_string_view<char, std::char_traits<char>>) | debug_logger(const std::string_view name) noexcept
{
if constexpr (debug) {
char buffer[512] = { '\0' };
auto written = fmt::format_to_n(
buffer,
511,
"{}-{}.log",
name,
std::hash<std::thread::id>{}(std::this_thre... | pushq %r15
pushq %r14
pushq %rbx
subq $0x230, %rsp # imm = 0x230
leaq 0x20(%rsp), %r14
vxorps %xmm0, %xmm0, %xmm0
leaq 0x30(%rsp), %r15
movq %rdi, %rbx
movq %rsi, (%r14)
movq %rdx, 0x8(%r14)
andq $0x0, (%rdi)
vmovups %zmm0, 0x1c0(%r15)
vmovups %zmm0, 0x180(%r15)
vmovups %zmm0, 0x140(%r15)
vmovups %zmm0, 0x10... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
fmt::v7::format_to_n_result<char*> fmt::v7::vformat_to_n<char*, char, 0>(char*, unsigned long, fmt::v7::basic_string_view<char>, fmt::v7::basic_format_args<fmt::v7::basic_format_context<fmt::v7::detail::buffer_appender<fmt::v7::type_identity<char>::type>, fmt::v7::type_identity<char>::type>>) | explicit iterator_buffer(OutputIt out, size_t n = buffer_size)
: Traits(n),
buffer<T>(data_, 0, buffer_size),
out_(out) {} | pushq %r14
pushq %rbx
subq $0x138, %rsp # imm = 0x138
leaq 0x38(%rsp), %rax
andq $0x0, -0x18(%rax)
movq %rsi, -0x10(%rax)
movq %rax, -0x30(%rax)
andq $0x0, -0x28(%rax)
leaq 0x58294d(%rip), %rsi # 0x63af20
movq $0x100, -0x20(%rax) # imm = 0x100
movq %rsi, -0x38(%rax)
movq %rdi, -0x8(%rax)
movq %rdx, %r... | /quesnel[P]baryonyx/external/fmt/include/fmt/core.h |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::vector<int, s... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x40(%rsp)
leaq 0x1c(%rsp), %rcx
leaq 0x18(%rsp), %r8
leaq 0x14(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r13
movq %rdi, %r12
leaq 0x3a38c4(%rip), %rdx # 0x45c344
vmovss %xmm0, (%rcx)
vmovss %xmm1, (%r8)
vmovss %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, true>, float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm::merged_constraint, std::... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x158, %rsp # imm = 0x158
vmovsd %xmm0, 0x58(%rsp)
vxorps %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x18(%rsp)
vmovups %zmm0, 0x58(%rdi)
vmovups %zmm0, 0x40(%rdi)
vmovups %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, true>, float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, baryonyx::pnm_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x39bd81(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, true>, float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, baryonyx::file_observer>::store_if_better(baryonyx::bit_array const&, double, long) | inline bool
is_better_solution(Float lhs, Float rhs) noexcept
{
if constexpr (std::is_same_v<Mode, minimize_tag>)
return lhs < rhs;
else
return lhs > rhs;
} | vucomisd 0x30(%rdi), %xmm0
jbe 0xbdd7e
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xbddf8
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
pop... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false> const, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryony... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, 0x20(%rsp)
cmpq %rax, 0x20(%rdi)
je 0xbeef8
movq %rax, 0x20(%rdi)
movq 0x20(%rsp), %rcx
leaq 0x18(%rdi), %rax
movq %rdi, 0x28(%rsp)
xorl %ebp, %ebp
movq %rax, 0x18(%rsp)
movl 0x78(%rcx), %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false> ... | int
compute_violated_constraints(const Solver& slv,
const Xtype& x,
std::vector<int>& out)
{
out.clear();
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
out.emplace_back(k);
return length(out);
} | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq (%rdx), %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
cmpq %rax, 0x8(%rdx)
je 0xbefd7
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x78(%r15), %esi
je 0xbf00a
movq %r15, %rdi
movq %r14, %rdx
callq 0xbf021
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::vector<int, ... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
leaq 0x10(%rdi), %rax
vmovss %xmm2, 0x14(%rsp)
vmovss %xmm1, 0x10(%rsp)
vmovss %xmm0, 0xc(%rsp)
movq %rcx, 0x30(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
xorl %ebp, %ebp
movq %rax, 0x28(%rsp)
cmpq 0x30(%rsp), %r14
je 0xbf265
... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, 0x20(%rsp)
cmpq %rax, 0x20(%rdi)
je 0xbf38e
movq %rax, 0x20(%rdi)
movq 0x20(%rsp), %rcx
leaq 0x18(%rdi), %rax
movq %rdi, 0x28(%rsp)
xorl %ebp, %ebp
movq %rax, 0x18(%rsp)
movl 0x78(%rcx), %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int const*, std::... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
leaq 0x10(%rdi), %rax
vmovss %xmm2, 0x14(%rsp)
vmovss %xmm1, 0x10(%rsp)
vmovss %xmm0, 0xc(%rsp)
movq %rcx, 0x30(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
xorl %ebp, %ebp
movq %rax, 0x28(%rsp)
cmpq 0x30(%rsp), %r14
je 0xbf52b
... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost... | int local_compute_violated_constraints(const Solver& slv, const Xtype& x)
{
int remaining = 0;
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
++remaining;
return remaining;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
xorl %ebp, %ebp
xorl %r15d, %r15d
cmpl 0x78(%r14), %r15d
je 0xbf572
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0xbf021
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0xbf552
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::vec... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
leaq 0x10(%rdi), %rax
vmovss %xmm3, 0x14(%rsp)
vmovss %xmm2, 0x10(%rsp)
vmovss %xmm1, 0xc(%rsp)
vmovss %xmm0, 0x8(%rsp)
movq %rcx, 0x30(%rsp)
movq %rdx, %r14
movq %rsi, %r12
movq %rdi, %r13
xorl %r15d, %r15d
movq %rax, 0x28(%rsp)
cmpq 0x... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryonyx::b... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
leaq 0x10(%rdi), %rax
vmovss %xmm3, 0x14(%rsp)
vmovss %xmm2, 0x10(%rsp)
vmovss %xmm1, 0xc(%rsp)
vmovss %xmm0, 0x8(%rsp)
movq %rcx, 0x30(%rsp)
movq %rdx, %r14
movq %rsi, %r12
movq %rdi, %r13
xorl %r15d, %r15d
movq %rax, 0x28(%rsp)
cmpq 0x... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>, float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, baryonyx::none_observer>::store_if_better(baryonyx::bit_array const&, double, long) | inline bool
is_better_solution(Float lhs, Float rhs) noexcept
{
if constexpr (std::is_same_v<Mode, minimize_tag>)
return lhs < rhs;
else
return lhs > rhs;
} | vucomisd 0x30(%rdi), %xmm0
jbe 0xc3f44
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0xc3fbe
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
pop... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, false>, float, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<float>, baryonyx::none_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0xb5a0
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x395ad9(%rip), %xmm1, %xmm1 # 0x459a80
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
pop... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>>(baryonyx::context const&, baryonyx::problem const&) | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x140, %rsp # imm = 0x140
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0xc4678
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x3527e
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups ... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::optimize_problem<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, false>, float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>>(baryonyx::context const&, baryonyx::problem const&) | inline result
optimize_problem(const context& ctx, const problem& pb)
{
result r;
if (ctx.start)
ctx.start(ctx.parameters);
auto constraints{ make_merged_constraints(ctx, pb) };
if (constraints.empty() || pb.vars.values.empty()) {
r.status = result_status::success;
r.solutions.... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x198, %rsp # imm = 0x198
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, %r13
movq %rsi, %r15
movq %rdi, %r12
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, false>, float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>>(baryonyx::context const&, baryonyx::problem const&) | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x140, %rsp # imm = 0x140
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0xc4ff9
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x3527e
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups ... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorder<baryon... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x158, %rsp # imm = 0x158
movq %rdi, %rbp
leaq 0x18(%rsp), %rdi
movq %rsi, %r15
movl %r8d, %esi
vmovsd %xmm0, 0x58(%rsp)
movq %r9, %r12
movl %r8d, %ebx
movq %rcx, %r14
movq %rdx, 0x28(%rsp)
callq 0x368ae
movq (%rbp), %r13
movq %rbp, 0x70... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::solver_equalities_01coeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::quadratic_cost_type<float> const&, std::vector<baryonyx::itm::mer... | solver_equalities_01coeff(random_engine& rng_,
int m_,
int n_,
const cost_type& c_,
const std::vector<merged_constraint>& csts)
: logger("solver_equalities_01coeff")
, rng(rng_)
, ap... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
movl %edx, %ebp
leaq 0x39661c(%rip), %rdx # 0x45c241
movq %r9, %r12
movq %r8, 0x20(%rsp)
movl %ecx, %r13d
movq %rsi, %r14
movq %rdi, %rbx
pushq $0x19
popq %rsi
callq 0xb8418
movq %r14, 0x8(%rbx)
leaq 0x10(%rbx), %r14
movq %r14, %rdi
m... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
int baryonyx::itm::compute_order::run<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, baryonyx::bit_array, float>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>&,... | int run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta)
{
bool pi_changed = false;
int remaining = 0;
switch (order) {
case solver_parameters::constraint_order::reversing:
so... | pushq %r15
pushq %r14
pushq %rbx
subq $0x20, %rsp
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0xc5f1f
leaq 0x395f35(%rip), %rdx # 0x45bd3c
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
leaq 0x18(%rsp), %rdx
leaq 0x10(%rsp), %rcx
movq... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, baryonyx::bit_array, float>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>... | int push_and_run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta,
Float objective_amplifier)
{
bool pi_changed = 0;
int remaining = 0;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x20, %rsp
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0xc6018
xorl %esi, %esi
leal 0x1(%rax), %edx
cmpl $0x7, %eax
cmovll %edx, %esi
movl %esi, %eax
movl %esi, 0x30(%r14)
decl %eax
cmpl $0x6, %eax
ja 0xc61b1
leaq 0x395d2e(%rip),... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::compute_update_row<baryonyx::bit_array, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>>(baryonyx::bit_array&, std::reverse_iterator<... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x48(%rsp)
movq %rdx, %rbx
leaq 0x1c(%rsp), %rcx
leaq 0x18(%rsp), %r8
leaq 0x14(%rsp), %r9
leaq 0x395e7c(%rip), %rdx # 0x45c344
movq %rsi, %r14
movq %rdi, %r12
vmovss %xmm0, (%rcx)
vmovss %xmm1, (%r8)
vmovss %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::vector<int,... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x40(%rsp)
leaq 0x1c(%rsp), %rcx
leaq 0x18(%rsp), %r8
leaq 0x14(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r13
movq %rdi, %r12
leaq 0x395cbc(%rip), %rdx # 0x45c344
vmovss %xmm0, (%rcx)
vmovss %xmm1, (%r8)
vmovss %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryonyx::bit_array... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x40(%rsp)
leaq 0x1c(%rsp), %rcx
leaq 0x18(%rsp), %r8
leaq 0x14(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r13
movq %rdi, %r12
leaq 0x395b0e(%rip), %rdx # 0x45c344
vmovss %xmm0, (%rcx)
vmovss %xmm1, (%r8)
vmovss %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::it... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, 0x20(%rsp)
cmpq %rax, 0x20(%rdi)
je 0xc69d6
movq %rax, 0x20(%rdi)
movq 0x20(%rsp), %rcx
leaq 0x18(%rdi), %rax
movq %rdi, 0x28(%rsp)
xorl %ebp, %ebp
movq %rax, 0x18(%rsp)
movl 0x78(%rcx), %... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int const*, std:... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x40(%rsp)
leaq 0x1c(%rsp), %rcx
leaq 0x18(%rsp), %r8
leaq 0x14(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r13
movq %rdi, %r12
leaq 0x39587a(%rip), %rdx # 0x45c344
vmovss %xmm0, (%rcx)
vmovss %xmm1, (%r8)
vmovss %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>, baryonyx::bit_array>(baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_c... | int local_compute_violated_constraints(const Solver& slv, const Xtype& x)
{
int remaining = 0;
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
++remaining;
return remaining;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
xorl %ebp, %ebp
xorl %r15d, %r15d
cmpl 0x78(%r14), %r15d
je 0xc6c78
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0xc6431
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0xc6c58
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::solver_equalities_01coeff<float, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<float>, true>::compute_reduced_costs<baryonyx::bit_array>(baryonyx::sparse_matrix<int>::row_value*, baryonyx::sparse_matrix<int>::row_value*, baryonyx::bit_array const&) | int compute_reduced_costs(sparse_matrix<int>::row_iterator begin,
sparse_matrix<int>::row_iterator end,
const Xtype& x) noexcept
{
int r_size = 0;
for (; begin != end; ++begin) {
Float sum_a_pi = 0;
Float sum_a_p = ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x18, %rsp
leaq 0x10(%rdi), %rbp
movq %rcx, %rbx
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r13
xorl %r12d, %r12d
cmpq %r14, %r15
je 0xc6d5f
movl 0x4(%r15), %edx
leaq 0x8(%rsp), %rdi
movq %rbp, %rsi
callq 0x3dede
movq 0x8(%rsp), %rax
movq 0x10(%rs... | /quesnel[P]baryonyx/lib/src/itm-solver-equalities-01.cpp |
Subsets and Splits
SQL Console for LLM4Binary/decompile-bench
Filters out entries with file names ending in .cpp, providing a basic subset of the dataset that excludes C++ files.