name string | code string | asm string | file string |
|---|---|---|---|
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<double>, baryonyx::itm::maximize_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 0x7191b
movq %rbx, %rdi
movq %r15, %rsi
callq 0x71a9a
movq 0x38(%rbx), %... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<double>, baryonyx::itm::maximize_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 0x71b51
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>> const, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::max... | 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 0x71b82
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_... | 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 0x71c80
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x80(%r15), %esi
je 0x71cb6
movq %r15, %rdi
movq %r14, %rdx
callq 0x71ccd
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<dou... | 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 0x71d2a
movslq (%r13... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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::reverse_ite... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3e22c1(%rip), %xmm1 # 0x454038
movq (%rdx), %rax
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x60(%rsp)
movq %rcx, 0x68(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdx, 0x58(%rsp)
movq %rdi, 0x10(%rsp)
movq %rs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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*, std::vecto... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3e1e47(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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>>>>>(baryonyx::bit... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3e19d7(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_... | 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 0x72ad4
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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<int const*... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3e1465(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx:... | 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 0x73059
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x71ccd
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x73036
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::quadratic_cost_type<double>::operator()(int, baryonyx::bit_array const&) const | Float operator()(int index, const bit_array& x) const noexcept
{
Float ret = linear_elements[index];
auto first = indices[index];
auto last = indices[index + 1];
for (; first != last; ++first)
if (x[quadratic_elements[first].id])
ret += quadratic_element... | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq 0x8(%rdi), %rcx
movq %rdx, %rbx
movq 0x18(%rdi), %rdx
movslq %esi, %rax
movq %rdi, %r14
vmovsd (%rcx,%rax,8), %xmm0
movslq (%rdx,%rax,4), %r15
movslq 0x4(%rdx,%rax,4), %r12
subq %r15, %r12
shlq $0x4, %r15
vmovsd %xmm0, (%rsp)
subq $0x1, %r12
jb 0x730ec
movq 0x... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc_data*>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc... | 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 0x10(%rdi), %rsi
cmpq %r14, %rsi
je 0x7316b
vmovsd (%rdi), %xmm0
leaq 0x10(%rsi), %r15
vucomisd (%rsi), %xmm0
movq %r15, %rsi
jne 0x73157
jnp 0x7313f
addq $-0x10, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x7368c
movq %r15, %rdi
jmp 0x7313b
movq %rb... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<double>, baryonyx::itm::maximize_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 0x74b2e
cmpl $0x0, 0x30(%rcx,%rdx)
jne 0x74b28
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<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 0x5c8466(%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<double>, baryonyx::itm::maximize_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::quadratic_cost_type<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 0x74d18
cmpl %ebx, 0x30(%rcx,%rdx)
jne 0x74d12
cmpq %r14, 0x20(%rc... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<double>, baryonyx::itm::maximize_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 0x5c8279(%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::quadratic_cost_type<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::storage<baryonyx::itm::quadratic_cost_type<double>, baryonyx::itm::maximize_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 0x3e4337(%rip), %rsi # 0x45a53d
movq %rdi, %r14
subq 0x38(%rdi), %rax
movq %rbx, %rdi
sarq $0x2, %rax
movq %rax, (%rdx)
callq 0x41545
leaq 0x3e432b(%rip), %r15 # 0x45a54e
xorl %r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::pnm_observer>::operator()(std::vector<baryonyx::itm::merged_constr... | 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 $0x3b8, %rsp # imm = 0x3B8
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::file_observer>::operator()(std::vector<baryonyx::itm::merged_const... | 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 $0x3b8, %rsp # imm = 0x3B8
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm::merged_const... | 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 $0x178, %rsp # imm = 0x178
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::pnm_observer>::store_if_better(baryonyx::bit_array const&, double,... | 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 0x775b8
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x77632
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, 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 0x3e2465(%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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::file_observer>::store_if_better(baryonyx::bit_array const&, double... | 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 0x7769a
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x77714
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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 0x3e2383(%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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::none_observer>::store_if_better(baryonyx::bit_array const&, double... | 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 0x7777c
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x777f6
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<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<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 0x3e22a1(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>(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 $0x130, %rsp # imm = 0x130
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0x77ea4
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<double>, baryonyx::itm::minimize_tag>::storage(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::default_cost_type<double> const&, double, int, int, std::vector<baryonyx::itm::merged_constraint, std::allocator<baryonyx::it... | 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<double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::itm::default_cost_type<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 %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
movl %ecx, %ebx
movq %rsi, %r14
movq %rdi, %r15
movl %edx, %r13d
xorl %r12d, %r12d
cmpq %r12, %r13
je 0x7877f
movq 0x8(%r14), %rcx
testl %ebx, %ebx
vxorpd %xmm1, %xmm1, %xmm1
setne %al
vmovsd (%rcx,%r12,8), %xmm0
vucomisd %xmm0, %xmm1
setnp %dl
sete %cl
vucomisd %x... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::init_with_pre_solve<baryonyx::itm::default_cost_type<double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::bit_array&, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::default_cost_type<double> const&, std::vector<baryonyx::itm::merged_const... | 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, 0x38(%rsp)
movq (%r8), %rax
movq 0x8(%r8), %rcx
movq %rdx, 0x30(%rsp)
vmovsd %xmm0, 0x48(%rsp)
movq %r8, %r13
xorl %edx, %edx
movq %rsi, 0x28(%rsp)
movq %rdi, 0x20(%rsp)
cmpq %rcx, %rax
je 0x787da
movq 0x8(%rax), %rsi
subq (%r... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<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 0x79589
movq 0x5c4553(%rip), %r13 # 0x63cfc8
movq (%r13), %rdi
leaq 0x3e1618(%rip), %rcx # 0x45a09... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorder<ba... | 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 $0x168, %rsp # imm = 0x168
movq %rdi, %rbp
leaq 0x10(%rsp), %rdi
movq %rsi, %r15
movl %r8d, %esi
vmovsd %xmm0, 0x50(%rsp)
movq %r9, %r12
movl %r8d, %ebx
movq %rcx, %r14
movq %rdx, 0x20(%rsp)
callq 0x368ae
movq (%rbp), %r13
movq %rbp, 0x58... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::solver_random_inequalities_101coeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::default_cost_type<double> const&, std::vector<baryo... | 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<double>, 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 0x5c29a6(%rip), %r12 # 0x63cfc8
movq %rdi, %r15
movq %rcx, %rbx
leaq 0x3dfd2c(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>... | 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 0x7a726
movq %rax, %rdi
jmp 0x7b1ea
cmpl $0x7, %ecx
jne 0x7a743
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x7a751
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x7a734
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array, double>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<d... | 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 $0x30, %rsp
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0x7a891
leaq 0x3df51f(%rip), %rdx # 0x459c98
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
leaq 0x28(%rsp), %rdx
leaq 0x20(%rsp), %rcx
movq... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<double>, 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<double>, 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 0x7e2ae
te... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array, double>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_co... | 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 $0x30, %rsp
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0x7aa94
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 0x7ac05
leaq 0x3df20e(%rip),... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::default_cost_type<double>, 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 0x7add8
jp 0x7add8
vmovsd 0x50(%r14), %xmm0
vucomisd %xmm1, %xmm0
jne 0x7add8
jp 0x7add8
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<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 0x7afa5
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7b124
movq 0x38(%rbx), %... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<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 0x7b1db
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>> const, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minim... | 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 0x7b20c
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type... | 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 0x7b30a
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x80(%r15), %esi
je 0x7b340
movq %r15, %rdi
movq %r14, %rdx
callq 0x7b357
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>... | 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 0x7b3b4
movslq (%r13... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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::reverse_itera... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3d8c37(%rip), %xmm1 # 0x454038
movq (%rdx), %rax
leaq 0x8(%rdi), %r14
leaq 0x48(%rsp), %r15
movq %rdi, %r12
vmovsd %xmm2, 0x68(%rsp)
movq %rcx, 0x70(%rsp)
movq %rsi, (%rsp)
movq %rdx, 0x60(%rsp)
movq %... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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*, std::vector<... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3d87d1(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r14
leaq 0x48(%rsp), %r15
movq %rdi, %r12
vmovsd %xmm2, 0x60(%rsp)
movq %rcx, 0x68(%rsp)
movq %rsi, (%rsp)
movq %rdi, 0x8(%rsp)
movq %r14, 0x58(%rsp)
vsu... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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>>>>>(baryonyx::bit_a... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3d8379(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r14
leaq 0x48(%rsp), %r15
movq %rdi, %r12
vmovsd %xmm2, 0x60(%rsp)
movq %rcx, 0x68(%rsp)
movq %rsi, (%rsp)
movq %rdi, 0x8(%rsp)
movq %r14, 0x58(%rsp)
vsu... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_ta... | 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 0x7c11a
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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<int const*, ... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3d7e1f(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r14
leaq 0x48(%rsp), %r15
movq %rdi, %r12
vmovsd %xmm2, 0x60(%rsp)
movq %rcx, 0x68(%rsp)
movq %rsi, (%rsp)
movq %rdi, 0x8(%rsp)
movq %r14, 0x58(%rsp)
vsu... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::i... | 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 0x7c687
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x7b357
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x7c664
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::stop_iterating<baryonyx::itm::minimize_tag, double>(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
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm1, %xmm0
jne 0x7c702
jp 0x7c702
callq 0x36ac3
vmovsd 0x3dc27a(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::rc_data*>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::rc_dat... | 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 0x10(%rdi), %rsi
cmpq %r14, %rsi
je 0x7c74a
vmovsd (%rdi), %xmm0
leaq 0x10(%rsi), %r15
vucomisd (%rsi), %xmm0
movq %r15, %rsi
jne 0x7c736
jnp 0x7c71e
addq $-0x10, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x7cc6b
movq %r15, %rdi
jmp 0x7c71a
movq %rb... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<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 0x7e10c
cmpl $0x0, 0x30(%rcx,%rdx)
jne 0x7e106
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<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 0x5bee88(%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<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<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 0x7e2f6
cmpl %ebx, 0x30(%rcx,%rdx)
jne 0x7e2f0
cmpq %r14, 0x20(%rc... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::default_cost_type<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 0x5bec9b(%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<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<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 0x3dad59(%rip), %rsi # 0x45a53d
movq %rdi, %r14
subq 0x38(%rdi), %rax
movq %rbx, %rdi
sarq $0x2, %rax
movq %rax, (%rdx)
callq 0x41545
leaq 0x3dad4d(%rip), %r15 # 0x45a54e
xorl %r... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::pnm_observer>::operator()(std::vector<baryonyx::itm::merged_constraint... | 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 $0x3a8, %rsp # imm = 0x3A8
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::file_observer>::operator()(std::vector<baryonyx::itm::merged_constrain... | 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 $0x3a8, %rsp # imm = 0x3A8
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm::merged_constrain... | 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 $0x168, %rsp # imm = 0x168
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::pnm_observer>::store_if_better(baryonyx::bit_array const&, double, lon... | 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 0x80b96
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x80c10
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, 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 0x3d8e87(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::file_observer>::store_if_better(baryonyx::bit_array const&, double, lo... | 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 0x80c7c
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x80cf6
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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 0x3d8da1(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::none_observer>::store_if_better(baryonyx::bit_array const&, double, lo... | 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 0x80d62
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x36a44
movq %r14, %rdi
callq 0x80ddc
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<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 0x3d8cbb(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>(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_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>(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 0x81496
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<double>, baryonyx::itm::minimize_tag>::storage(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, baryonyx::itm::quadratic_cost_type<double> const&, double, int, int, std::vector<baryonyx::itm::merged_constraint, std::allocator<baryonyx... | 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<double>, baryonyx::itm::minimize_tag>(baryonyx::bit_array&, baryonyx::itm::quadratic_cost_type<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 0x81d75
testl %ebx, %ebx
movq %r14, %rdi
movl %r12d, %esi
setne %r13b
callq 0x6e256
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm1, %xmm0
setnp %c... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::init_with_pre_solve<baryonyx::itm::quadratic_cost_type<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<double> const&, std::vector<baryonyx::itm::merged_c... | 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, %r15
movq (%r8), %rax
movq 0x8(%r8), %rcx
movq %rdx, %r12
vmovsd %xmm0, 0x48(%rsp)
movq %r8, %r13
xorl %edx, %edx
movq %rsi, 0x40(%rsp)
movq %rdi, 0x20(%rsp)
cmpq %rcx, %rax
je 0x81dd1
movq 0x8(%rax), %rsi
subq (%rax), %rsi
sh... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<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 0x82b93
movq 0x5baf49(%rip), %r13 # 0x63cfc8
movq (%r13), %rdi
leaq 0x3d800e(%rip), %rcx # 0x45a09... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorde... | 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 $0x178, %rsp # imm = 0x178
movq %rdi, %rbp
leaq 0x10(%rsp), %rdi
movq %rsi, %r15
movl %r8d, %esi
vmovsd %xmm0, 0x50(%rsp)
movq %r9, %r12
movl %r8d, %ebx
movq %rcx, %r14
movq %rdx, 0x20(%rsp)
callq 0x368ae
movq (%rbp), %r13
movq %rbp, 0x58... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>::solver_random_inequalities_101coeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::quadratic_cost_type<double> const&, std::vector<b... | 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::quadratic_cost_type<double>, 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 0x5b939c(%rip), %r12 # 0x63cfc8
movq %rdi, %r15
movq %rcx, %rbx
leaq 0x3d6722(%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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<dou... | 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 0x83d30
movq %rax, %rdi
jmp 0x847f4
cmpl $0x7, %ecx
jne 0x83d4d
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x83d5b
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x83d3e
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array, double>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_ty... | 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 $0x30, %rsp
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0x83e9b
leaq 0x3d5f4d(%rip), %rdx # 0x459cd0
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
leaq 0x28(%rsp), %rdx
leaq 0x20(%rsp), %rcx
movq... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::quadratic_cost_type<double>, 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<double>, 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 0x878ea
te... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::best_solution_recorder<baryonyx::itm::quadratic_cost_type<double>, 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 0x843e2
jp 0x843e2
vmovsd 0x50(%r14), %xmm0
vucomisd %xmm1, %xmm0
jne 0x843e2
jp 0x843e2
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<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 0x845af
movq %rbx, %rdi
movq %r15, %rsi
callq 0x8472e
movq 0x38(%rbx), %... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<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 0x847e5
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>> const, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::min... | 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 0x84816
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_... | 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 0x84914
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x80(%r15), %esi
je 0x8494a
movq %r15, %rdi
movq %r14, %rdx
callq 0x84961
testb %al... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<dou... | 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 0x849be
movslq (%r13... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<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::reverse_ite... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3cf62d(%rip), %xmm1 # 0x454038
movq (%rdx), %rax
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x60(%rsp)
movq %rcx, 0x68(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdx, 0x58(%rsp)
movq %rdi, 0x10(%rsp)
movq %rs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<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*, std::vecto... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3cf1b3(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
bool baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<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>>>>>(baryonyx::bit... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3ced43(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_... | 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 0x85768
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<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<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<int const*... | 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 $0x88, %rsp
vmovsd %xmm1, 0x20(%rsp)
vmovsd 0x3ce7d1(%rip), %xmm1 # 0x454038
leaq 0x8(%rdi), %r15
vmovsd %xmm2, 0x58(%rsp)
movq %rcx, 0x60(%rsp)
movq %rsi, %r13
movq %rdi, %r12
movq %rdi, 0x10(%rsp)
movq %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubs... | /quesnel[P]baryonyx/lib/src/random-solver.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>, baryonyx::bit_array>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx:... | 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 0x85ced
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x84961
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x85cca
movl %ebp, %eax
addq $0x8, %rsp... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc_data*>(baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc... | 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 0x10(%rdi), %rsi
cmpq %r14, %rsi
je 0x85d85
vmovsd (%rdi), %xmm0
leaq 0x10(%rsi), %r15
vucomisd (%rsi), %xmm0
movq %r15, %rsi
jne 0x85d71
jnp 0x85d59
addq $-0x10, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x862a6
movq %r15, %rdi
jmp 0x85d55
movq %rb... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<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 0x87748
cmpl $0x0, 0x30(%rcx,%rdx)
jne 0x87742
... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::storage<baryonyx::itm::quadratic_cost_type<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 0x5b584c(%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 |
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.