name
stringlengths 1
473k
| code
stringlengths 7
647k
| asm
stringlengths 4
3.39M
| file
stringlengths 8
196
|
|---|---|---|---|
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(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_bastert);
to_log(stdout,
7u,
"- crossover between {} ({}) and bastert\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_bastert;
}
} else {
init_with_random(m_random, ctx.rng, x.size(), 0.5);
if (b(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_random);
to_log(stdout,
7u,
"- crossover between {} ({}) and random\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_random;
}
}
} else {
int first = m_indices[choose_a_solution(ctx)];
int second = m_indices[choose_a_solution(ctx)];
while (first == second)
second = m_indices[choose_a_solution(ctx)];
crossover(ctx, x, m_data[first].x, m_data[second].x);
to_log(stdout,
7u,
"- crossover between {} ({}) and {} ({})\n",
first,
m_data[first].value,
second,
m_data[second].value);
}
} | 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), %rcx
cltq
movl (%rcx,%rax,4), %eax
movl %eax, 0x8(%rsp)
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3e70b2(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x719bf
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3e7098(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x71a43
movslq 0x8(%rsp), %rax
leaq 0x68(%rbx), %r8
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x71ade
addq $0x50, %rbx
leaq 0x3e8a8e(%rip), %rcx # 0x45a3a2
pushq $0x28
jmp 0x71a1a
movq %rbx, %rdi
movq %r15, %rsi
callq 0x71a9a
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %r12
movl %r12d, 0x8(%rsp)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x71a9a
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %rax
movl %eax, 0xc(%rsp)
cmpl %eax, %r12d
jne 0x71960
movq %rbx, %rdi
movq %r15, %rsi
callq 0x71a9a
jmp 0x71940
movq 0x50(%rbx), %r8
imulq $0x38, %r12, %r12
imulq $0x38, %rax, %r13
leaq (%r8,%r12), %rcx
addq %r13, %r8
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x71ade
movq 0x5cb640(%rip), %rax # 0x63cfc8
movq 0x50(%rbx), %rdx
movq (%rax), %rdi
leaq 0x10(%rdx,%r13), %rax
leaq 0x10(%rdx,%r12), %r9
leaq 0xc(%rsp), %r10
leaq 0x3e8a4e(%rip), %rcx # 0x45a3f3
pushq $0x7
popq %rsi
pushq $0x28
popq %rdx
leaq 0x8(%rsp), %r8
pushq %rax
pushq %r10
callq 0x3c3e1
popq %rax
popq %rcx
jmp 0x71a62
movl (%r14), %edx
leaq 0x78(%rbx), %r12
vmovsd 0x3e6faa(%rip), %xmm0 # 0x458978
movq %r12, %rdi
movq %r15, %rsi
callq 0x362ac
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3e6f8f(%rip), %xmm1 # 0x458978
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
vucomisd %xmm0, %xmm1
jbe 0x71a57
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %r8
callq 0x71ade
addq $0x50, %rbx
leaq 0x3e89b3(%rip), %rcx # 0x45a3cb
pushq $0x27
popq %rdx
movq 0x5cb5a6(%rip), %rax # 0x63cfc8
leaq 0x8(%rsp), %r8
movq (%rbx), %rsi
movslq (%r8), %r9
movq (%rax), %rdi
imulq $0x38, %r9, %rax
leaq 0x10(%rsi,%rax), %r9
pushq $0x7
popq %rsi
callq 0x3c388
jmp 0x71a62
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
addq $0x68, %rbx
movq %rbx, %r12
movq %rcx, %rdi
movq %r12, %rsi
callq 0x36a44
leaq 0x10(%rsp), %rdi
callq 0x3c450
addq $0x20, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x71a84
jmp 0x71a84
jmp 0x71a84
jmp 0x71a84
jmp 0x71a84
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x3c450
movq %rbx, %rdi
callq 0xb3d0
nop
| /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 auto x2 = second.block(i);
x.set_block(i, ((x1 ^ x2) & ctx.crossover_dist(ctx.rng)) ^ x1);
}
} | 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
movl %ebp, %esi
movq %rax, %rbx
callq 0x377b0
movq %rax, %r14
movq %r13, %rdi
movq %r12, %rsi
callq 0x3709a
andnq %rbx, %rax, %rcx
andq %rax, %r14
orq %rcx, %r14
movq (%rsp), %rcx
movq 0x8(%rcx), %rax
movq %r14, (%rax,%rbp,8)
incq %rbp
jmp 0x71b07
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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::maximize_tag, baryonyx::itm::quadratic_cost_type<double>> const&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x71c47
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3c868
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x71bfb
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x71bd3
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x71c1c
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x71c2d
subl 0x4(%rcx,%rdx), %ebx
jle 0x71c3a
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x71ba8
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_type<double>> const&, baryonyx::bit_array const&, std::vector<int, std::allocator<int>>&) | 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, %al
jne 0x71cae
movq %rbx, %rdi
movq %r12, %rsi
callq 0x31460
movl 0x4(%rsp), %esi
incl %esi
jmp 0x71c87
movq 0x8(%rbx), %rax
subq (%rbx), %rax
shrq $0x2, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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<double>> const&, int, baryonyx::bit_array const&) | 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), %rax
movq 0x48(%rbx), %rcx
movl 0x4(%r13), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r13
addl %eax, %r15d
jmp 0x71d02
movslq 0x4(%rsp), %rcx
movq 0x58(%rbx), %rax
imulq $0xc, %rcx, %rcx
cmpl %r15d, (%rax,%rcx)
jle 0x71d41
xorl %eax, %eax
jmp 0x71d49
cmpl 0x4(%rax,%rcx), %r15d
setle %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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 %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
movq 0x68(%rsp), %rcx
cmpq (%rcx), %rax
je 0x7217c
movslq -0x4(%rax), %rdx
cmpl 0x80(%r12), %edx
jge 0x72190
leaq 0x28(%rsp), %rdi
movq %rdx, 0x40(%rsp)
movq %r15, %rsi
callq 0x3de66
vmovsd 0x60(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x73066
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x71eaf
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x71e5a
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x71e39
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x71e03
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x730fd
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x71fb2
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3e6a23(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x71f9b
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x71f08
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x71fba
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x71fc6
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x71fbf
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x720da
testb $0x1, %al
je 0x720da
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x72011
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x72081
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x72081
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x67e58
testb %al, %al
je 0x72081
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3e6922(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x720c9
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3e68dc(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x71fd8
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x7214f
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3e6865(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x720df
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x71ccd
testb %al, %al
je 0x721b1
movq 0x58(%rsp), %rcx
movq 0x50(%rsp), %r15
movq (%rcx), %rax
addq $-0x4, %rax
movq %rax, (%rcx)
jmp 0x71db1
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3e6047(%rip), %rdi # 0x4581de
leaq 0x3e82dc(%rip), %rsi # 0x45a47a
leaq 0x3e80a2(%rip), %rdx # 0x45a247
leaq 0x3e82d4(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3e6026(%rip), %rdi # 0x4581de
leaq 0x3e82c5(%rip), %rsi # 0x45a484
leaq 0x3e8081(%rip), %rdx # 0x45a247
leaq 0x3e82d8(%rip), %rcx # 0x45a4a5
callq 0x2813f
| /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::vector<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x725eb
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x725ff
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x73066
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x72324
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x722cf
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x722ae
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x72278
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x730fd
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x72427
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3e65ae(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x72410
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x7237d
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7242f
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x7243b
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x72434
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x7254f
testb $0x1, %al
je 0x7254f
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x72486
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x724f6
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x724f6
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x67e58
testb %al, %al
je 0x724f6
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3e64ad(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x7253e
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3e6467(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x7244d
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x725c4
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3e63f0(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x72554
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x71ccd
testb %al, %al
je 0x72620
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x4, %rdx
jmp 0x72223
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3e5bd8(%rip), %rdi # 0x4581de
leaq 0x3e7e6d(%rip), %rsi # 0x45a47a
leaq 0x3e7c33(%rip), %rdx # 0x45a247
leaq 0x3e7e65(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3e5bb7(%rip), %rdi # 0x4581de
leaq 0x3e7e56(%rip), %rsi # 0x45a484
leaq 0x3e7c12(%rip), %rdx # 0x45a247
leaq 0x3e7e69(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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_array&, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x72a5b
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x72a6f
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x73066
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x72794
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x7273f
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x7271e
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x726e8
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x730fd
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x72897
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3e613e(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x72880
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x727ed
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7289f
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x728ab
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x728a4
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x729bf
testb $0x1, %al
je 0x729bf
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x728f6
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x72966
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x72966
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x67e58
testb %al, %al
je 0x72966
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3e603d(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x729ae
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3e5ff7(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x728bd
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x72a34
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3e5f80(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x729c4
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x71ccd
testb %al, %al
je 0x72a90
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x8, %rdx
jmp 0x72693
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3e5768(%rip), %rdi # 0x4581de
leaq 0x3e79fd(%rip), %rsi # 0x45a47a
leaq 0x3e77c3(%rip), %rdx # 0x45a247
leaq 0x3e79f5(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3e5747(%rip), %rdi # 0x4581de
leaq 0x3e79e6(%rip), %rsi # 0x45a484
leaq 0x3e77a2(%rip), %rdx # 0x45a247
leaq 0x3e79f9(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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_tag, baryonyx::itm::quadratic_cost_type<double>>&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x72b99
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3de66
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x72b4d
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x72b25
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x72b6e
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x72b7f
subl 0x4(%rcx,%rdx), %ebx
jle 0x72b8c
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x72afa
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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*, std::vector<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x72fcd
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x72fe1
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x73066
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x72d06
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x72cb1
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x72c90
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x72c5a
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x730fd
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x72e09
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3e5bcc(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x72df2
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x72d5f
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x72e11
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x72e1d
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x72e16
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x72f31
testb $0x1, %al
je 0x72f31
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x72e68
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x72ed8
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x72ed8
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x67e58
testb %al, %al
je 0x72ed8
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3e5acb(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x72f20
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3e5a85(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x72e2f
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x72fa6
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3e5a0e(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x72f36
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x71ccd
testb %al, %al
je 0x73002
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x4, %rdx
jmp 0x72c05
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3e51f6(%rip), %rdi # 0x4581de
leaq 0x3e748b(%rip), %rsi # 0x45a47a
leaq 0x3e7251(%rip), %rdx # 0x45a247
leaq 0x3e7483(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3e51d5(%rip), %rdi # 0x4581de
leaq 0x3e7474(%rip), %rsi # 0x45a484
leaq 0x3e7230(%rip), %rdx # 0x45a247
leaq 0x3e7487(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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::itm::quadratic_cost_type<double>> const&, baryonyx::bit_array const&) | 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
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
| /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_elements[first].factor;
return ret;
} | 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 0x10(%r14), %rax
movq %rbx, %rdi
movl 0x8(%rax,%r15), %esi
callq 0x3664a
testl %eax, %eax
je 0x730e6
movq 0x10(%r14), %rax
vmovsd (%rsp), %xmm0
vaddsd (%rax,%r15), %xmm0, %xmm0
vmovsd %xmm0, (%rsp)
addq $0x10, %r15
jmp 0x730b7
vmovsd (%rsp), %xmm0
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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_data*, baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc_data*, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&) | 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;
}
}
std::shuffle(ret, begin, rng);
} | 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 %rbx, %rdx
callq 0x7368c
popq %rbx
popq %r14
popq %r15
retq
jmp 0x7317b
movq %rax, %rdi
callq 0xeb9f
| /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_data[i].hash == hash)
return false;
return true;
} | 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
vmovsd 0x10(%rcx,%rdx), %xmm0
vucomisd %xmm1, %xmm0
jne 0x74b28
jp 0x74b28
cmpq %rbx, 0x20(%rcx,%rdx)
je 0x74b2e
addq $0x38, %rdx
jmp 0x74b07
cmpq %rdx, %rax
leaq 0x8(%rsp), %rdi
sete %bl
callq 0x3c450
movl %ebx, %eax
addq $0x18, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rdi
callq 0xeb9f
| /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: {}) {}s in {} loops\n",
value,
hash,
duration,
loop);
int id_to_delete = m_indices[choose_a_bad_solution(ctx)];
to_log(stdout,
5u,
"- delete {} ({})\n",
id_to_delete,
m_data[id_to_delete].value);
replace_result(id_to_delete, x, value, duration, hash, loop, 0);
sort();
} | 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 (%r12), %rdi
leaq 0x3e5931(%rip), %rcx # 0x45a4ca
pushq $0x5
popq %rsi
pushq $0x30
popq %rdx
movq %rax, %r8
pushq %r11
pushq %r10
callq 0x3fb9e
popq %rax
popq %rcx
leaq 0x68(%r15), %rdi
movq %r15, %rsi
callq 0x3fce2
movq 0x38(%rbx), %rcx
cltq
leaq 0x4(%rsp), %r8
movq (%r12), %rdi
movslq (%rcx,%rax,4), %rax
movl %eax, (%r8)
imulq $0x38, %rax, %rax
movq 0x50(%rbx), %rcx
leaq 0x10(%rcx,%rax), %r9
leaq 0x3e5918(%rip), %rcx # 0x45a4fb
pushq $0x5
popq %rsi
pushq $0x11
popq %rdx
callq 0x3c388
vmovsd 0x18(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
movl 0x4(%rsp), %esi
movq 0x20(%rsp), %rcx
movq 0x8(%rsp), %r8
movq %rbx, %rdi
movq %r14, %rdx
xorl %r9d, %r9d
callq 0x74c32
movq %rbx, %rdi
callq 0x6e17a
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
| /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) noexcept
{
m_indices_reader lock{ m_indices_mutex };
m_data[id].x = x;
m_data[id].value = value;
m_data[id].duration = duration;
m_data[id].hash = hash;
m_data[id].loop = loop;
m_data[id].remaining_constraints = remaining_constraints;
} | 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, %rax
imulq $0x38, %rax, %rbp
addq %rbp, %rdi
movq %r13, %rsi
callq 0x36a44
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
movq 0x50(%r12), %rax
leaq 0x18(%rsp), %rdi
vmovsd %xmm0, 0x10(%rax,%rbp)
vmovsd %xmm1, 0x18(%rax,%rbp)
movq %r15, 0x20(%rax,%rbp)
movq %r14, 0x28(%rax,%rbp)
movl %ebx, 0x30(%rax,%rbp)
callq 0x3c450
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rdi
callq 0xeb9f
nop
| /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;
return true;
} | 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(%rcx,%rdx)
je 0x74d18
addq $0x38, %rdx
jmp 0x74d00
cmpq %rdx, %rax
movq %rsp, %rdi
sete %bl
callq 0x3c450
movl %ebx, %eax
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
| /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 advance {} (hash: {}) {}s in {} loops\n",
remaining_constraints,
hash,
duration,
loop);
int id_to_delete = m_indices[choose_a_bad_solution(ctx)];
to_log(stdout,
5u,
"- delete {} ({})\n",
id_to_delete,
m_data[id_to_delete].value);
replace_result(id_to_delete,
x,
costs.results(x, cost_constant),
duration,
hash,
loop,
remaining_constraints);
sort();
} | 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 %r9, (%r13)
movq (%r12), %rdi
leaq 0x3e5787(%rip), %rcx # 0x45a50d
pushq $0x5
popq %rsi
pushq $0x2f
popq %rdx
movq %r10, %r8
movq %rax, %r9
pushq %r13
pushq %r11
callq 0x3ff5c
popq %rax
popq %rcx
leaq 0x68(%r15), %rdi
movq %r15, %rsi
callq 0x3fce2
movq 0x38(%rbx), %rcx
cltq
leaq 0x8(%rsp), %r8
movq (%r12), %rdi
movslq (%rcx,%rax,4), %rax
movl %eax, (%r8)
imulq $0x38, %rax, %rax
movq 0x50(%rbx), %rcx
leaq 0x10(%rcx,%rax), %r9
leaq 0x3e5728(%rip), %rcx # 0x45a4fb
pushq $0x5
popq %rsi
pushq $0x11
popq %rdx
callq 0x3c388
vmovsd 0x90(%rbx), %xmm0
movl 0x8(%rsp), %ebp
movq 0x88(%rbx), %rdi
movq %r14, %rsi
callq 0x6e096
vmovsd 0x18(%rsp), %xmm1
movq 0x20(%rsp), %rcx
movq 0x10(%rsp), %r8
movl 0xc(%rsp), %r9d
movq %rbx, %rdi
movl %ebp, %esi
movq %r14, %rdx
callq 0x74c32
movq %rbx, %rdi
callq 0x6e17a
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rdi
callq 0xeb9f
| /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;
value = m_data[id].value;
duration = m_data[id].duration;
loop = m_data[id].loop;
} | 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(%rcx,%rax), %edx
movl %edx, (%r12)
vmovsd 0x10(%rcx,%rax), %xmm0
vmovsd %xmm0, (%r15)
vmovsd 0x18(%rcx,%rax), %xmm0
vmovsd %xmm0, (%r14)
movq 0x28(%rcx,%rax), %rax
movq %rax, (%rbx)
callq 0x3c450
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
nop
| /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,
m_data[m_indices[i]].remaining_constraints,
m_data[m_indices[i]].hash);
} | 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 %r12d, %r12d
xorl %r13d, %r13d
movl 0x98(%r14), %eax
cmpq %rax, %r13
je 0x7626b
movq 0x38(%r14), %rdx
movq 0x50(%r14), %rax
movq %rbx, %rdi
movslq (%rdx,%r12), %rcx
addq %r12, %rdx
imulq $0x38, %rcx, %rsi
leaq 0x10(%rax,%rsi), %rcx
leaq 0x30(%rax,%rsi), %r8
leaq 0x20(%rax,%rsi), %r9
movq %r15, %rsi
callq 0x41567
incq %r13
addq $0x4, %r12
jmp 0x76229
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
nop
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::quadratic_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x80(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x6fb57
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x76390
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x80(%rsp), %rsi
movl %ebx, %edx
callq 0x6fc31
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0x78(%rsp)
vmovsd %xmm1, 0x70(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xd8(%rsp), %rdi
leaq 0x80(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x6fcaa
movl 0xcc(%r12), %esi
leaq 0xa0(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x160(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x7646d
cmpl $0x1, %eax
je 0x76447
cmpl $0x2, %eax
jne 0x7647e
movq 0x18(%r14), %rdx
leaq 0x160(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x76458
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x160(%rsp), %rsi
vmovsd 0x3ddbd8(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x6ddd4
jmp 0x7647e
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x6dd5f
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x764b3
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x764af
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x7648d
leaq 0x168(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
movl 0x158(%rsp), %ecx
movl 0x15c(%rsp), %r8d
movq 0xb0(%r12), %r9
vmovsd %xmm0, (%rsp)
leaq 0x3e408d(%rip), %rdx # 0x45a577
leaq 0x160(%rsp), %rdi
pushq $0x3
popq %rsi
callq 0x42b5a
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0xa0(%rsp), %rdi
leaq 0xd8(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x6ffd2
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %r13
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x76617
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa0(%rsp), %rdi
leaq 0xd8(%rsp), %rsi
movq %r13, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
movq 0x140(%rsp), %rdx
movq 0x138(%rsp), %rcx
movl %eax, %ebx
leaq 0x160(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
callq 0x6c2be
testl %ebx, %ebx
je 0x766bc
cmpl %ebp, %ebx
jge 0x765b7
movq %r14, %rdi
movq %r13, %rsi
movl %ebx, %edx
movq %r15, %rcx
callq 0x775ba
movl %ebx, %ebp
cmpq 0x48(%rsp), %r15
jle 0x765ec
vcvtsi2sd %ebx, %xmm3, %xmm0
vcvtsi2sdl 0x158(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x765f1
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x76617
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x775f2
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x76617
incq %r15
jmp 0x76537
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x76639
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x76667
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x35781
leaq 0x160(%rsp), %rdi
callq 0x42cbc
leaq 0xa0(%rsp), %rdi
callq 0x393ac
leaq 0xd8(%rsp), %rdi
callq 0x7054c
leaq 0x80(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x3b8, %rsp # imm = 0x3B8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x6e096
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x77570
vmovsd (%rsp), %xmm0
leaq 0xd8(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x76626
vmovsd %xmm0, (%rsp)
vmulsd 0x78(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x70(%rsp), %xmm3
leaq 0xa0(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7032a
testl %eax, %eax
jne 0x76772
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77570
movq %r14, %rdi
callq 0x775f2
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x76626
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x76873
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa0(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
testl %eax, %eax
je 0x76837
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x7680d
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x158(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x76812
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x76873
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x775f2
testb %al, %al
jne 0x7686e
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x76790
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77570
vmovsd (%rsp), %xmm0
jmp 0x76873
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x766fe
jmp 0x768b9
jmp 0x76892
jmp 0x768b9
movq %rax, %r14
jmp 0x768c9
movq %rax, %r14
jmp 0x768d6
movq %rax, %r14
jmp 0x768e3
movq %rax, %r14
jmp 0x768f0
movq %rax, %r14
jmp 0x768fa
jmp 0x768b9
jmp 0x768b9
jmp 0x768b9
leaq 0x168(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x768c9
leaq 0x160(%rsp), %rdi
movq %rax, %r14
callq 0x42cbc
leaq 0xa0(%rsp), %rdi
callq 0x393ac
leaq 0xd8(%rsp), %rdi
callq 0x7054c
leaq 0x80(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::quadratic_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x80(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x6fb57
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x769fa
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x80(%rsp), %rsi
movl %ebx, %edx
callq 0x6fc31
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0x78(%rsp)
vmovsd %xmm1, 0x70(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xd8(%rsp), %rdi
leaq 0x80(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x6fcaa
movl 0xcc(%r12), %esi
leaq 0xa0(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x160(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x76ad7
cmpl $0x1, %eax
je 0x76ab1
cmpl $0x2, %eax
jne 0x76ae8
movq 0x18(%r14), %rdx
leaq 0x160(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x76ac2
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x160(%rsp), %rsi
vmovsd 0x3dd56e(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x6ddd4
jmp 0x76ae8
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x6dd5f
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x76b1d
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x76b19
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x76af7
leaq 0x168(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
movl 0x158(%rsp), %ecx
movl 0x15c(%rsp), %r8d
movq 0xb0(%r12), %r9
vmovsd %xmm0, (%rsp)
leaq 0x3e3a23(%rip), %rdx # 0x45a577
leaq 0x160(%rsp), %rdi
pushq $0x3
popq %rsi
callq 0x4346e
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0xa0(%rsp), %rdi
leaq 0xd8(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x6ffd2
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %r13
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x76c81
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa0(%rsp), %rdi
leaq 0xd8(%rsp), %rsi
movq %r13, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
movq 0x140(%rsp), %rdx
movq 0x138(%rsp), %rcx
movl %eax, %ebx
leaq 0x160(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
callq 0x6c6c0
testl %ebx, %ebx
je 0x76d26
cmpl %ebp, %ebx
jge 0x76c21
movq %r14, %rdi
movq %r13, %rsi
movl %ebx, %edx
movq %r15, %rcx
callq 0x7769c
movl %ebx, %ebp
cmpq 0x48(%rsp), %r15
jle 0x76c56
vcvtsi2sd %ebx, %xmm3, %xmm0
vcvtsi2sdl 0x158(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x76c5b
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x76c81
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x776d4
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x76c81
incq %r15
jmp 0x76ba1
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x76ca3
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x76cd1
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x35781
leaq 0x160(%rsp), %rdi
callq 0x435d0
leaq 0xa0(%rsp), %rdi
callq 0x393ac
leaq 0xd8(%rsp), %rdi
callq 0x7054c
leaq 0x80(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x3b8, %rsp # imm = 0x3B8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x6e096
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x77652
vmovsd (%rsp), %xmm0
leaq 0xd8(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x76c90
vmovsd %xmm0, (%rsp)
vmulsd 0x78(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x70(%rsp), %xmm3
leaq 0xa0(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7032a
testl %eax, %eax
jne 0x76ddc
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77652
movq %r14, %rdi
callq 0x776d4
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x76c90
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x76edd
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa0(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
testl %eax, %eax
je 0x76ea1
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x76e77
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x158(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x76e7c
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x76edd
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x776d4
testb %al, %al
jne 0x76ed8
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x76dfa
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77652
vmovsd (%rsp), %xmm0
jmp 0x76edd
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x76d68
jmp 0x76f23
jmp 0x76efc
jmp 0x76f23
movq %rax, %r14
jmp 0x76f33
movq %rax, %r14
jmp 0x76f40
movq %rax, %r14
jmp 0x76f4d
movq %rax, %r14
jmp 0x76f5a
movq %rax, %r14
jmp 0x76f64
jmp 0x76f23
jmp 0x76f23
jmp 0x76f23
leaq 0x168(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x76f33
leaq 0x160(%rsp), %rdi
movq %rax, %r14
callq 0x435d0
leaq 0xa0(%rsp), %rdi
callq 0x393ac
leaq 0xd8(%rsp), %rdi
callq 0x7054c
leaq 0x80(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::quadratic_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x98(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x6fb57
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x77064
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x98(%rsp), %rsi
movl %ebx, %edx
callq 0x6fc31
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0x90(%rsp)
vmovsd %xmm1, 0x88(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xf0(%rsp), %rdi
leaq 0x98(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x6fcaa
movl 0xcc(%r12), %esi
leaq 0xb8(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x70(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x7713e
cmpl $0x1, %eax
je 0x7711b
cmpl $0x2, %eax
jne 0x7714f
movq 0x18(%r14), %rdx
leaq 0x70(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x77129
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x70(%rsp), %rsi
vmovsd 0x3dcf07(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x6ddd4
jmp 0x7714f
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x6dd5f
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x77184
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x77180
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x7715e
leaq 0x78(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
vmovsd %xmm0, (%rsp)
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x6ffd2
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %rbx
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x77297
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
movq %rbx, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
movl %eax, %r13d
testl %eax, %eax
je 0x7732f
cmpl %ebp, %r13d
jge 0x77236
movq %r14, %rdi
movq %rbx, %rsi
movl %r13d, %edx
movq %r15, %rcx
callq 0x7777e
movl %r13d, %ebp
cmpq 0x48(%rsp), %r15
jle 0x7726c
vcvtsi2sd %r13d, %xmm3, %xmm0
vcvtsi2sdl 0x170(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x77271
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x77297
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x777b6
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x77297
incq %r15
jmp 0x771d7
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x772b9
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x772e7
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x35781
leaq 0xb8(%rsp), %rdi
callq 0x393ac
leaq 0xf0(%rsp), %rdi
callq 0x7054c
leaq 0x98(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x178, %rsp # imm = 0x178
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x6e096
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x77734
vmovsd (%rsp), %xmm0
leaq 0xf0(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x772a6
vmovsd %xmm0, (%rsp)
vmulsd 0x90(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x88(%rsp), %xmm3
leaq 0xb8(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7032a
testl %eax, %eax
jne 0x773eb
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77734
movq %r14, %rdi
callq 0x777b6
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x772a6
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x774ec
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xb8(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x70014
testl %eax, %eax
je 0x774b0
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x77486
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x170(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x7748b
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x774ec
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x777b6
testb %al, %al
jne 0x774e7
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x77409
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x6e096
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x77734
vmovsd (%rsp), %xmm0
jmp 0x774ec
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x77371
jmp 0x7752a
jmp 0x77506
jmp 0x7752a
movq %rax, %r14
jmp 0x7753a
movq %rax, %r14
jmp 0x77547
movq %rax, %r14
jmp 0x77554
movq %rax, %r14
jmp 0x7755e
jmp 0x7752a
jmp 0x7752a
jmp 0x7752a
leaq 0x78(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x7752d
movq %rax, %r14
leaq 0xb8(%rsp), %rdi
callq 0x393ac
leaq 0xf0(%rsp), %rdi
callq 0x7054c
leaq 0x98(%rsp), %rdi
callq 0x6d8d6
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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, 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 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
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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, 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 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
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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, 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 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
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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_engine rng(init_random_generator_seed(ctx));
auto cost = Cost(pb.objective, variables);
auto cost_constant = pb.objective.value;
switch (ctx.parameters.observer) {
case solver_parameters::observer_type::pnm: {
using obs = pnm_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
} break;
case solver_parameters::observer_type::file: {
using obs = file_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
} break;
default: {
using obs = none_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
break;
}
}
} else {
ret.status = result_status::success;
ret.solutions.resize(1);
ret.solutions.back().value = pb.objective.value;
}
ret.strings = pb.strings;
ret.variable_name = std::move(pb.vars.names);
ret.affected_vars = std::move(pb.affected_vars);
ret.variables = variables;
ret.constraints = length(constraints);
if (ctx.finish)
ctx.finish(ret);
return ret;
} | 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 %zmm0, (%rbx)
movq $0x7fffffff, 0x98(%rbx) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rbx)
movq 0xb0(%r15), %rax
subq 0xa8(%r15), %rax
pushq $0xc
popq %rcx
cqto
idivq %rcx
movq %rax, %r12
leaq 0x8(%rsp), %rdi
movq %r14, %rsi
movq %r15, %rdx
vzeroupper
callq 0x450078
movq 0x8(%rsp), %rax
cmpq 0x10(%rsp), %rax
je 0x77fcd
movq 0xa8(%r15), %rax
cmpq 0xb0(%r15), %rax
je 0x77fcd
movq %r14, %rdi
callq 0x353ba
movl $0x7fffffff, %ecx # imm = 0x7FFFFFFF
xorl %edx, %edx
leaq 0x10(%r15), %rsi
divq %rcx
cmpq $0x1, %rdx
adcq $0x0, %rdx
movq %rdx, (%rsp)
leaq 0x20(%rsp), %rdi
movl %r12d, %edx
callq 0x625f0
vmovsd 0x40(%r15), %xmm0
movl 0xe4(%r14), %eax
vxorps %xmm1, %xmm1, %xmm1
leaq 0x30(%rsp), %rsi
cmpl $0x1, %eax
je 0x77ff4
cmpl $0x2, %eax
jne 0x78043
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x88(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x7fee8
jmp 0x78090
andl $0x0, 0xa0(%rbx)
leaq 0x68(%rbx), %rdi
pushq $0x1
popq %rsi
callq 0x35292
vmovsd 0x40(%r15), %xmm0
movq 0x70(%rbx), %rax
vmovsd %xmm0, -0x8(%rax)
jmp 0x780bf
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x88(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x7f880
jmp 0x78090
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x88(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x80550
leaq 0x88(%rsp), %r13
movq %rbx, %rdi
movq %r13, %rsi
callq 0x41d9e
movq %r13, %rdi
callq 0xea60
leaq 0x58(%rsp), %rdi
callq 0x357fe
leaq 0x28(%rsp), %rdi
callq 0x29066
leaq 0x90(%r15), %r13
movq %rbx, %rdi
movq %r15, %rsi
callq 0x31d28
leaq 0x50(%rbx), %rdi
movq %r13, %rsi
callq 0x352ec
addq $0xc0, %r15
leaq 0x20(%rbx), %rdi
movq %r15, %rsi
callq 0x352c2
movq 0x10(%rsp), %rax
movl %r12d, 0x90(%rbx)
subq 0x8(%rsp), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
movl %eax, 0x94(%rbx)
cmpq $0x0, 0x168(%r14)
je 0x7812b
addq $0x158, %r14 # imm = 0x158
movq %r14, %rdi
movq %rbx, %rsi
callq 0x357ea
leaq 0x8(%rsp), %rdi
callq 0x35858
movq %rbx, %rax
addq $0x130, %rsp # imm = 0x130
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x7814d
jmp 0x7814d
leaq 0x58(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
leaq 0x28(%rsp), %rdi
callq 0x29066
jmp 0x78170
jmp 0x7816d
movq %rax, %r14
jmp 0x7817a
movq %rax, %r14
leaq 0x8(%rsp), %rdi
callq 0x35858
movq %rbx, %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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::itm::merged_constraint>> const&) | 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_bastert(variables)
, m_random(variables)
, costs(costs_)
, cost_constant(cost_constant_)
, m_size(population_size)
{
for (auto& elem : m_data)
elem.x = bit_array(variables);
init_with_bastert<Cost, Mode>(m_bastert, costs_, variables, 0);
for (int i = 0, e = m_size / 2; i != e; ++i) {
m_data[i].x = m_bastert;
std::bernoulli_distribution dist(
std::clamp(static_cast<double>(i) / (5 * e), 0.0, 1.0));
for (int v = 0; v != variables; ++v)
if (dist(rng))
m_data[i].x.invert(v);
}
for (int i = m_size / 2, e = m_size; i + 1 < e; i += 2) {
init_with_random(m_data[i].x, rng, variables, 0.2);
init_with_random(m_data[i + 1].x, rng, variables, 0.8);
init_with_pre_solve<Cost, Mode>(
m_data[i].x,
m_data[i + 1].x,
rng,
costs_,
constraints_,
std::clamp(static_cast<double>(i) / (5 * e), 0.0, 1.0));
}
for (int i = 0, e = m_size; i != e; ++i) {
m_data[i].make_hash();
m_data[i].value = costs.results(m_data[i].x, cost_constant_);
m_data[i].remaining_constraints = 0;
for (int k = 0, end_k = length(constraints_); k != end_k; ++k) {
int sum = 0;
for (const auto& elem : constraints_[k].elements) {
if (m_data[i].x[elem.variable_index])
sum += elem.factor;
}
if (!(constraints_[k].min <= sum &&
sum <= constraints_[k].max))
++m_data[i].remaining_constraints;
}
}
std::iota(std::begin(m_indices), std::end(m_indices), 0);
sort();
} | 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 %ymm0, (%rdi)
addq $0x38, %rdi
movq %r12, %rsi
movq %rdi, 0x48(%rsp)
vzeroupper
callq 0x3140c
leaq 0x50(%r15), %r14
leaq 0x58(%rsp), %rdx
movq %r14, %rdi
movq %r12, %rsi
callq 0x4f90a
leaq 0x68(%r15), %rdi
movl %ebp, %esi
movq %rdi, 0x10(%rsp)
callq 0x368ae
leaq 0x78(%r15), %rdi
movl %ebp, %esi
callq 0x368ae
vmovsd 0x40(%rsp), %xmm0
movq 0x18(%rsp), %rax
movq %r15, 0x8(%rsp)
leaq 0x58(%rsp), %r12
movq %rax, 0x88(%r15)
vmovsd %xmm0, 0x90(%r15)
movl %ebx, 0x98(%r15)
movq 0x50(%r15), %rbx
movq 0x58(%r15), %r15
cmpq %r15, %rbx
je 0x783ff
movq %r12, %rdi
movl %ebp, %esi
callq 0x368ae
movq %rbx, %rdi
movq %r12, %rsi
callq 0x3696c
leaq 0x60(%rsp), %rdi
callq 0x357fe
addq $0x38, %rbx
jmp 0x783d5
movq 0x10(%rsp), %rdi
movq 0x18(%rsp), %rsi
xorl %r15d, %r15d
movl %ebp, %edx
xorl %ecx, %ecx
callq 0x7871d
movq 0x8(%rsp), %rax
movl 0x98(%rax), %eax
pushq $0x2
popq %rcx
cltd
idivl %ecx
movq %rax, 0x20(%rsp)
leal (%rax,%rax,4), %eax
vcvtsi2sd %eax, %xmm1, %xmm0
vmovsd %xmm0, 0x50(%rsp)
cmpq 0x20(%rsp), %r15
je 0x784b1
movq (%r14), %rdi
imulq $0x38, %r15, %r12
addq %r12, %rdi
movq 0x10(%rsp), %rsi
callq 0x36a44
vcvtsi2sd %r15d, %xmm3, %xmm0
vdivsd 0x50(%rsp), %xmm0, %xmm0
vmovsd 0x3dbbd2(%rip), %xmm1 # 0x454038
xorl %ebx, %ebx
vminsd %xmm0, %xmm1, %xmm2
vxorpd %xmm1, %xmm1, %xmm1
vcmpltsd %xmm1, %xmm0, %k1
vmovsd %xmm1, %xmm2, %xmm2 {%k1}
vmovapd %xmm2, 0x30(%rsp)
cmpl %ebx, %ebp
je 0x784ac
movq %r13, %rdi
callq 0x36ac3
vmovapd 0x30(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x784a8
movq (%r14), %rdi
movl %ebx, %esi
addq %r12, %rdi
callq 0x3626e
incl %ebx
jmp 0x78483
incq %r15
jmp 0x78438
movq 0x8(%rsp), %rax
movslq 0x98(%rax), %rsi
movl %esi, %eax
cltd
pushq $0x2
popq %rcx
idivl %ecx
leal (%rsi,%rsi,4), %ecx
movq %rsi, 0x30(%rsp)
vcvtsi2sd %ecx, %xmm3, %xmm0
vmovsd %xmm0, 0x10(%rsp)
movslq %eax, %r12
movl %eax, %r15d
imulq $0x38, %r12, %rbx
incq %r12
cmpq 0x30(%rsp), %r12
jge 0x78577
vmovsd 0x3e1591(%rip), %xmm0 # 0x459a88
movq (%r14), %rdi
movq %r13, %rsi
movl %ebp, %edx
addq %rbx, %rdi
callq 0x362ac
vmovsd 0x3e1581(%rip), %xmm0 # 0x459a90
movq (%r14), %rax
movq %r13, %rsi
movl %ebp, %edx
leaq 0x38(%rax,%rbx), %rdi
callq 0x362ac
vcvtsi2sd %r15d, %xmm3, %xmm0
vdivsd 0x10(%rsp), %xmm0, %xmm1
vmovsd 0x3dbb04(%rip), %xmm0 # 0x454038
movq (%r14), %rdi
movq 0x18(%rsp), %rcx
movq 0x28(%rsp), %r8
vxorpd %xmm2, %xmm2, %xmm2
movq %r13, %rdx
leaq 0x38(%rdi,%rbx), %rsi
addq %rbx, %rdi
vcmpltsd %xmm2, %xmm1, %k1
vminsd %xmm1, %xmm0, %xmm0
vmovsd %xmm2, %xmm0, %xmm0 {%k1}
callq 0x78789
addl $0x2, %r15d
addq $0x70, %rbx
addq $0x2, %r12
jmp 0x784e4
movq 0x8(%rsp), %rax
movl 0x98(%rax), %eax
movq %rax, 0x20(%rsp)
xorl %eax, %eax
cmpq 0x20(%rsp), %rax
je 0x7866e
movq 0x8(%rsp), %rbx
imulq $0x38, %rax, %rbp
movq %rax, 0x10(%rsp)
movq 0x50(%rbx), %rdi
addq %rbp, %rdi
callq 0x4fc80
vmovsd 0x40(%rsp), %xmm0
movq 0x50(%rbx), %rsi
movq 0x88(%rbx), %rdi
addq %rbp, %rsi
callq 0x62f18
movq 0x50(%rbx), %rax
vmovsd %xmm0, 0x10(%rax,%rbp)
andl $0x0, 0x30(%rax,%rbp)
movq 0x28(%rsp), %rax
movq (%rax), %rcx
movq 0x8(%rax), %rax
subq %rcx, %rax
cqto
pushq $0x28
popq %rsi
idivq %rsi
movl %eax, %eax
movq %rax, 0x18(%rsp)
xorl %eax, %eax
cmpq 0x18(%rsp), %rax
je 0x78661
imulq $0x28, %rax, %r12
movq %rax, 0x30(%rsp)
xorl %r15d, %r15d
movq (%rcx,%r12), %r13
movq 0x8(%rcx,%r12), %rbx
cmpq %rbx, %r13
je 0x78637
movq (%r14), %rdi
movl 0x4(%r13), %esi
addq %rbp, %rdi
callq 0x3664a
testl %eax, %eax
je 0x7862e
movl (%r13), %eax
addl %eax, %r15d
addq $0x8, %r13
jmp 0x78612
movq 0x28(%rsp), %rax
movq (%rax), %rcx
cmpl %r15d, 0x18(%rcx,%r12)
jg 0x78650
addq %rcx, %r12
cmpl 0x1c(%r12), %r15d
jle 0x78657
movq (%r14), %rax
incl 0x30(%rax,%rbp)
movq 0x30(%rsp), %rax
incq %rax
jmp 0x785f6
movq 0x10(%rsp), %rax
incq %rax
jmp 0x78589
movq 0x8(%rsp), %rdi
xorl %edx, %edx
movq 0x38(%rdi), %rax
movq 0x40(%rdi), %rcx
cmpq %rcx, %rax
je 0x7868c
movl %edx, (%rax)
incl %edx
addq $0x4, %rax
jmp 0x7867d
callq 0x78a40
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
jmp 0x786c7
movq %rax, %rbx
jmp 0x786d3
movq %rax, %rbx
jmp 0x786db
jmp 0x786b3
jmp 0x786b3
movq 0x8(%rsp), %r15
movq %rax, %rbx
leaq 0x80(%r15), %rdi
callq 0x357fe
addq $0x70, %r15
movq %r15, %rdi
callq 0x357fe
movq %r14, %rdi
callq 0x4fd7c
movq 0x48(%rsp), %rdi
callq 0x26a34
movq %rbx, %rdi
callq 0xb3d0
nop
| /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 %xmm0, %xmm1
ja 0x7876f
andb %dl, %cl
andb %cl, %al
jne 0x7876f
movq %r15, %rdi
movl %r12d, %esi
callq 0x36a06
jmp 0x7877a
movq %r15, %rdi
movl %r12d, %esi
callq 0x369c8
incq %r12
jmp 0x78734
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, double) | 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 = 0;
for (const auto& cst : constraints)
if (length(cst.elements) > max_length)
max_length = length(cst.elements);
struct reduced_cost
{
float value;
int factor;
int id;
};
std::vector<reduced_cost> R(max_length);
std::bernoulli_distribution dist(init_random);
for (const auto& cst : constraints) {
if (!dist(rng))
continue;
R.resize(cst.elements.size());
const int r_size = length(cst.elements);
for (int i = 0; i != r_size; ++i) {
R[i].value = static_cast<float>(c[cst.elements[i].variable_index]);
R[i].factor = cst.elements[i].factor;
R[i].id = cst.elements[i].variable_index;
}
std::shuffle(std::begin(R), std::end(R), rng);
std::sort(
std::begin(R), std::end(R), [](const auto& lhs, const auto& rhs) {
return is_better_solution<Mode>(lhs.value, rhs.value);
});
if (!x_pessimistic.empty()) {
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (cst.min <= sum && sum <= cst.max) {
best = i;
break;
}
if (i + 1 < r_size)
sum += R[i + 1].factor;
}
int i = 0;
for (; i <= best; ++i)
x_pessimistic.set(R[i].id);
for (; i != r_size; ++i) {
x_pessimistic.unset(R[i].id);
}
}
if (!x_optimistic.empty()) {
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (cst.min <= sum && sum <= cst.max)
best = i;
if (best != -2 && i + 1 < r_size &&
stop_iterating<Mode>(R[i + 1].value))
break;
if (i + 1 < r_size)
sum += R[i + 1].factor;
}
int i = 0;
for (; i <= best; ++i)
x_optimistic.set(R[i].id);
for (; i != r_size; ++i)
x_optimistic.unset(R[i].id);
}
}
} | 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 (%rax), %rsi
shrq $0x3, %rsi
cmpl %esi, %edx
cmovgl %edx, %esi
addq $0x28, %rax
movl %esi, %edx
jmp 0x787bd
movl %edx, %esi
leaq 0x8(%rsp), %rdi
leaq 0x7(%rsp), %rdx
callq 0x78b1c
movq 0x8(%r13), %rax
movq (%r13), %rbp
movq 0x30(%rsp), %r13
movq %rax, 0x50(%rsp)
cmpq 0x50(%rsp), %rbp
je 0x78a1d
movq %r13, %rdi
callq 0x36ac3
vmovsd 0x48(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x78a14
movq 0x8(%rbp), %rsi
subq (%rbp), %rsi
sarq $0x3, %rsi
leaq 0x8(%rsp), %rdi
callq 0x78b70
movq 0x38(%rsp), %rcx
movq (%rbp), %rax
movq 0x8(%rbp), %r15
movq 0x8(%rsp), %rdx
movl $0x2003, %esi # imm = 0x2003
movq 0x8(%rcx), %rcx
subq %rax, %r15
addq $0x4, %rdx
bextrq %rsi, %r15, %r14
xorl %esi, %esi
cmpq %rsi, %r14
je 0x78886
movq (%rax,%rsi,8), %rdi
incq %rsi
movq %rdi, %r8
sarq $0x20, %r8
vcvtsd2ss (%rcx,%r8,8), %xmm2, %xmm0
vmovss %xmm0, -0x4(%rdx)
movq %rdi, (%rdx)
addq $0xc, %rdx
jmp 0x7885f
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rsi
movq %r13, %rdx
callq 0x78ba8
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rsi
callq 0x7900b
movq 0x20(%rsp), %rax
cmpq $0x0, 0x8(%rax)
je 0x78952
movq 0x8(%rsp), %rax
movq %r15, %rcx
shrq $0x3, %rcx
xorl %esi, %esi
movslq %ecx, %rdx
addq $0x4, %rax
pushq $-0x1
popq %rcx
movq %r15, 0x40(%rsp)
imulq $0xc, %rcx, %rdi
addq %rax, %rdi
cmpq %rdx, %rcx
jge 0x788fa
cmpl %esi, 0x18(%rbp)
jg 0x788ea
cmpl 0x1c(%rbp), %esi
jle 0x788fd
incq %rcx
addq $0xc, %rdi
cmpq %rdx, %rcx
jge 0x788db
addl (%rdi), %esi
jmp 0x788d4
pushq $-0x2
popq %rcx
movslq %ecx, %r15
movq %r14, %rbx
pushq $0x8
popq %r13
xorl %r12d, %r12d
cmpq %r15, %r12
jg 0x7892e
movq 0x8(%rsp), %rax
movq 0x20(%rsp), %rdi
movl (%rax,%r13), %esi
callq 0x369c8
incq %r12
addq $0xc, %r13
decq %rbx
jmp 0x7890a
movq 0x40(%rsp), %r15
subq $0x1, %rbx
jb 0x78952
movq 0x8(%rsp), %rax
movq 0x20(%rsp), %rdi
movl (%rax,%r13), %esi
callq 0x36a06
addq $0xc, %r13
jmp 0x78933
movq 0x28(%rsp), %rax
movq 0x30(%rsp), %r13
cmpq $0x0, 0x8(%rax)
je 0x78a14
movq 0x8(%rsp), %rax
shrq $0x3, %r15
xorl %edx, %edx
movslq %r15d, %rcx
addq $0xc, %rax
pushq $-0x1
popq %rsi
pushq $-0x2
popq %rdi
imulq $0xc, %rsi, %r8
addq %rax, %r8
movl %edi, %r9d
cmpq %rcx, %rsi
jge 0x789cc
cmpl 0x1c(%rbp), %edx
movl %esi, %edi
cmovgl %r9d, %edi
cmpl %edx, 0x18(%rbp)
cmovgl %r9d, %edi
incq %rsi
cmpl $-0x2, %edi
je 0x789ba
cmpq %rcx, %rsi
jge 0x789ba
vmovss (%r8), %xmm0
vucomiss 0x3e1100(%rip), %xmm0 # 0x459ab8
ja 0x789c9
addq $0xc, %r8
cmpq %rcx, %rsi
jge 0x78986
addl -0x8(%r8), %edx
jmp 0x7897f
movl %edi, %r9d
movslq %r9d, %r15
pushq $0x8
popq %rbx
xorl %r12d, %r12d
cmpq %r15, %r12
jg 0x78a0e
movq 0x8(%rsp), %rax
movq 0x28(%rsp), %rdi
movl (%rax,%rbx), %esi
callq 0x369c8
incq %r12
addq $0xc, %rbx
decq %r14
jmp 0x789d5
movq 0x8(%rsp), %rax
movq 0x28(%rsp), %rdi
movl (%rax,%rbx), %esi
callq 0x36a06
addq $0xc, %rbx
subq $0x1, %r14
jae 0x789f8
addq $0x28, %rbp
jmp 0x787fd
leaq 0x8(%rsp), %rdi
callq 0x78db4
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x78a38
movq %rax, %rdi
callq 0xeb9f
| /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;
const double value_1 = this->m_data[i1].value;
const double value_2 = this->m_data[i2].value;
if (cst_1 < cst_2)
return true;
if (cst_1 == cst_2)
return is_better_solution<Mode>(value_1, value_2);
return false;
});
#ifdef BARYONYX_ENABLE_DEBUG
to_log(stdout, 3u, "- Solutions init population:\n");
for (int i = 0; i != m_size; ++i) {
to_log(stdout,
5u,
"- {} id {} value {} constraint {} hash {}\n",
i,
m_indices[i],
m_data[m_indices[i]].value,
m_data[m_indices[i]].remaining_constraints,
m_data[m_indices[i]].hash);
}
#endif
} | 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 # 0x45a098
pushq $0x3
popq %rsi
pushq $0x1d
popq %rdx
callq 0x377fc
leaq 0x3e1624(%rip), %r14 # 0x45a0b6
xorl %eax, %eax
pushq $0x5
popq %rbp
pushq $0x2a
popq %r15
leaq 0x4(%rsp), %r12
movl %eax, 0x4(%rsp)
cmpl 0x98(%rbx), %eax
je 0x78af9
movq 0x38(%rbx), %rcx
cltq
movq 0x50(%rbx), %rdx
movq (%r13), %rdi
leaq (%rcx,%rax,4), %r9
movslq (%r9), %rax
imulq $0x38, %rax, %rax
leaq 0x10(%rdx,%rax), %r10
leaq 0x30(%rdx,%rax), %r11
leaq 0x20(%rdx,%rax), %rax
subq $0x8, %rsp
movq %r15, %rdx
movl %ebp, %esi
movq %r14, %rcx
movq %r12, %r8
pushq %rax
pushq %r11
pushq %r10
callq 0x3783f
addq $0x20, %rsp
movl 0x4(%rsp), %eax
incl %eax
jmp 0x78aa0
leaq 0x8(%rsp), %rdi
callq 0x378b4
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x78b14
movq %rax, %rdi
callq 0xeb9f
| /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<baryonyx::itm::default_cost_type<double>, double, baryonyx::itm::minimize_tag>&, std::vector<baryonyx::itm::merged_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::default_cost_type<double> const&, double) | 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_constant)
{
bit_array x(variables);
auto& p = m_ctx.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_local_ctx.rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const auto w_limit = static_cast<long int>(p.w);
Solver slv(m_local_ctx.rng,
length(constraints),
variables,
norm_costs,
constraints);
compute_order compute(p.order, variables);
bool is_a_solution = false;
while (!stop_task.load()) {
++m_call_number;
const auto kappa_start = static_cast<Float>(best_recorder.reinit(
m_local_ctx, is_a_solution, p.kappa_min, p.kappa_max, x));
auto kappa = kappa_start;
compute.init(slv, x);
auto best_remaining = INT_MAX;
is_a_solution = false;
for (long int i = 0; !stop_task.load() && i != p.limit; ++i) {
auto remaining =
compute.run(slv, x, m_local_ctx.rng, kappa, delta, theta);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
i);
best_remaining = 0;
is_a_solution = true;
break;
} else {
best_remaining = std::min(remaining, best_remaining);
}
if (i > w_limit)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
}
if (best_remaining > 0) {
best_recorder.try_advance(
m_local_ctx, x, best_remaining, p.limit);
continue;
}
for (int push = 0; !stop_task.load() && push < p.pushes_limit;
++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_local_ctx.rng,
pushing_k_factor,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
is_a_solution = true;
}
kappa = kappa_start;
for (int iter = 0;
!stop_task.load() && iter < p.pushing_iteration_limit;
++iter) {
remaining = compute.run(
slv, x, m_local_ctx.rng, kappa, delta, theta);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
is_a_solution = true;
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
}
}
}
} | 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(%rsp)
addq $0x8, %rbp
leaq 0x80(%rsp), %rdi
movq %r13, %rsi
movq %r12, 0x48(%rsp)
movq %r12, %rdx
movq %rbp, %rcx
movl %ebx, %r8d
callq 0x64935
vmovsd 0x20(%r13), %xmm0
vmovsd 0x10(%r13), %xmm1
vmovsd %xmm0, 0x70(%rsp)
vmovsd 0x28(%r13), %xmm0
vmovsd %xmm1, 0x38(%rsp)
vmovsd %xmm0, 0x78(%rsp)
vmovsd 0x30(%r13), %xmm0
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x8(%r13), %xmm0
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x79fc0
movq 0x58(%rsp), %rax
movq (%rax), %rdi
vmovsd 0x40(%rsp), %xmm0
leaq 0x80(%rsp), %rsi
movl %ebx, %edx
callq 0x64a13
vmovsd %xmm0, 0x38(%rsp)
vcvttsd2si 0xa0(%r13), %rax
vmovsd 0x38(%r13), %xmm0
vmovsd 0x40(%r13), %xmm1
movq %rax, 0x90(%rsp)
movq 0x8(%r14), %rax
vmovsd %xmm0, 0xa0(%rsp)
vmovsd %xmm1, 0x98(%rsp)
subq (%r14), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xe0(%rsp), %rdi
leaq 0x80(%rsp), %r8
movq %rbp, %rsi
movl %eax, %edx
movl %ebx, %ecx
movq %r14, %r9
callq 0x7a3e8
movl 0xcc(%r13), %esi
leaq 0xa8(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq $0x0, 0x8(%rsp)
movb (%r15), %al
testb $0x1, %al
jne 0x7a34f
movq 0x58(%rsp), %rax
incq 0xb0(%rax)
vmovsd 0x18(%r13), %xmm0
vmovsd 0x28(%r13), %xmm1
movzbl 0x8(%rsp), %edx
movq 0x20(%rsp), %rdi
leaq 0x10(%rsp), %rbx
movq %rbp, %rsi
movq %rbx, %rcx
andl $0x1, %edx
callq 0x7a610
vmovsd %xmm0, 0x60(%rsp)
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
movq %rbx, %rdx
callq 0x7a710
vmovsd 0x60(%rsp), %xmm0
movl $0x7fffffff, %ebx # imm = 0x7FFFFFFF
xorl %r14d, %r14d
movb (%r15), %al
testb $0x1, %al
jne 0x7a147
cmpq 0xb0(%r13), %r14
je 0x7a147
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
leaq 0x10(%rsp), %rdx
movq %rbp, %rcx
vmovsd %xmm0, 0x28(%rsp)
callq 0x7a752
testl %eax, %eax
je 0x7a15f
cmpl %eax, %ebx
cmovgel %eax, %ebx
cmpq 0x90(%rsp), %r14
jle 0x7a131
vcvtsi2sd %eax, %xmm3, %xmm0
vcvtsi2sdl 0x160(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x68(%rsp), %xmm1
callq 0xb1f0
vmovsd 0x28(%rsp), %xmm1
vfmadd231sd 0x70(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x7a137
vmovsd 0x28(%rsp), %xmm0
vucomisd 0x78(%rsp), %xmm0
ja 0x7a147
incq %r14
jmp 0x7a0a8
testl %ebx, %ebx
jg 0x7a32f
leaq 0x10(%rsp), %rbx
movq $0x0, 0x8(%rsp)
jmp 0x7a191
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
leaq 0x10(%rsp), %rbx
movq %rbx, %rsi
callq 0x62f18
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %rbx, %rdx
movq %r14, %rcx
callq 0x7a95e
movb $0x1, %al
movq %rax, 0x8(%rsp)
xorl %r14d, %r14d
movl $0x0, 0x34(%rsp)
movb (%r15), %al
testb $0x1, %al
jne 0x7a03c
cmpl 0xbc(%r13), %r14d
jge 0x7a03c
vmovsd 0xa0(%rsp), %xmm0
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
vmovsd 0x98(%rsp), %xmm3
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
movq %rbx, %rdx
movq %rbp, %rcx
callq 0x7aa68
testl %eax, %eax
jne 0x7a22b
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
movq %rbx, %rsi
callq 0x62f18
movl 0xc0(%r13), %eax
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %rbx, %rdx
imull %r14d, %eax
notl %eax
movslq %eax, %rcx
callq 0x7a95e
movb $0x1, %al
movq %rax, 0x8(%rsp)
pushq $0x1
popq %rax
vmovsd 0x60(%rsp), %xmm0
movl %eax, %ebx
movb (%r15), %al
testb $0x1, %al
jne 0x7a2d9
leal -0x1(%rbx), %r12d
cmpl 0xc0(%r13), %r12d
jge 0x7a2d9
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
leaq 0x10(%rsp), %rdx
movq %rbp, %rcx
vmovsd %xmm0, 0x28(%rsp)
callq 0x7a752
testl %eax, %eax
je 0x7a2e0
vcvtsi2sd %r12d, %xmm4, %xmm0
vucomisd 0xa0(%r13), %xmm0
jbe 0x7a2c4
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x160(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x68(%rsp), %xmm1
callq 0xb1f0
vmovsd 0x28(%rsp), %xmm1
vfmadd231sd 0x70(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x7a2ca
vmovsd 0x28(%rsp), %xmm0
vucomisd 0x78(%rsp), %xmm0
ja 0x7a2d9
incl %ebx
jmp 0x7a236
leaq 0x10(%rsp), %rbx
jmp 0x7a323
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
leaq 0x10(%rsp), %r12
movq %r12, %rsi
callq 0x62f18
movl 0xc0(%r13), %eax
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %r12, %rdx
imull 0x34(%rsp), %eax
subl %ebx, %eax
movq %r12, %rbx
movslq %eax, %rcx
callq 0x7a95e
movb $0x1, %al
movq %rax, 0x8(%rsp)
decl 0x34(%rsp)
incl %r14d
jmp 0x7a19c
movq 0xb0(%r13), %r8
movq 0x20(%rsp), %rdi
leaq 0x10(%rsp), %rdx
movq %rbp, %rsi
movl %ebx, %ecx
callq 0x7a9e6
jmp 0x7a033
leaq 0xa8(%rsp), %rdi
callq 0x393ac
leaq 0xe0(%rsp), %rdi
callq 0x7ac8a
leaq 0x88(%rsp), %rdi
callq 0x29066
leaq 0x18(%rsp), %rdi
callq 0x357fe
addq $0x168, %rsp # imm = 0x168
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x7a399
movq %rax, %rbx
jmp 0x7a3bb
movq %rax, %rbx
jmp 0x7a3c8
movq %rax, %rbx
jmp 0x7a3d5
jmp 0x7a3ab
jmp 0x7a3ab
jmp 0x7a3ab
jmp 0x7a3ab
leaq 0xa8(%rsp), %rdi
movq %rax, %rbx
callq 0x393ac
leaq 0xe0(%rsp), %rdi
callq 0x7ac8a
leaq 0x88(%rsp), %rdi
callq 0x29066
leaq 0x18(%rsp), %rdi
callq 0x357fe
movq %rbx, %rdi
callq 0xb3d0
nop
| /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<baryonyx::itm::merged_constraint, std::allocator<baryonyx::itm::merged_constraint>> 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_vector_size(csts)))
, b(std::make_unique<bound_factor[]>(m_))
, pi(std::make_unique<Float[]>(m_))
, P(std::make_unique<Float[]>(ap.size()))
, c(c_)
, dist(0.5)
, m(m_)
, n(n_)
{
int id = 0;
for (int i = 0, e = length(csts); i != e; ++i) {
int lower = 0, upper = 0;
for (const auto& cst : csts[i].elements) {
bx_ensures(std::abs(cst.factor) == 1);
A[id++] = cst.factor;
if (cst.factor > 0)
upper++;
else
lower++;
}
if (csts[i].min == csts[i].max) {
b[i].min = csts[i].min;
b[i].max = csts[i].max;
} else {
b[i].min = std::max(-lower, csts[i].min);
b[i].max = std::min(upper, csts[i].max);
}
bx_ensures(b[i].min <= b[i].max);
}
} | 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
movq %r13, 0x18(%rsp)
callq 0x28eb6
movq %r12, %rdi
leaq 0x50(%r15), %rbp
callq 0x3a89d
movq %rbp, 0x10(%rsp)
movq %rbp, %rdi
movq %rax, %rsi
callq 0x7acc8
movslq %r14d, %rbp
leaq 0x58(%r15), %rdi
movq %rbp, %rsi
movq %rdi, 0x8(%rsp)
callq 0x7ad08
leaq 0x60(%r15), %r13
movq %r13, %rdi
movq %rbp, %rsi
callq 0x2900a
movl 0x30(%r15), %esi
leaq 0x68(%r15), %rdi
callq 0x2900a
movq 0x20(%rsp), %rax
movq %rax, 0x70(%r15)
movabsq $0x3fe0000000000000, %rax # imm = 0x3FE0000000000000
movq %rax, 0x78(%r15)
movl 0x4(%rsp), %eax
movl %r14d, 0x80(%r15)
movl %eax, 0x84(%r15)
movq (%r12), %rcx
movq 0x8(%r12), %rax
subq %rcx, %rax
pushq $0x28
popq %rsi
cqto
xorl %edi, %edi
idivq %rsi
movq 0x58(%r15), %rdx
xorl %esi, %esi
movl %eax, %eax
cmpq %rax, %rsi
je 0x7a592
imulq $0x28, %rsi, %r8
movq (%rbx), %r15
movslq %edi, %rdi
xorl %r10d, %r10d
movq (%rcx,%r8), %r11
movq 0x8(%rcx,%r8), %r14
leaq (%rcx,%r8), %r9
xorl %r8d, %r8d
cmpq %r14, %r11
je 0x7a525
movl (%r11), %r12d
leal 0x1(%r12), %ebp
testl $0xfffffffd, %ebp # imm = 0xFFFFFFFD
jne 0x7a5a1
movl %r12d, (%r15,%rdi,4)
incq %rdi
xorl %ebp, %ebp
xorl %r12d, %r12d
cmpl $0x0, (%r11)
setle %bpl
setg %r12b
addq $0x8, %r11
addl %r12d, %r10d
addl %ebp, %r8d
jmp 0x7a4e8
movl 0x18(%r9), %r11d
cmpl 0x1c(%r9), %r11d
jne 0x7a53c
imulq $0xc, %rsi, %r8
movl %r11d, (%rdx,%r8)
movl %r11d, %r8d
jmp 0x7a55c
negl %r8d
cmpl %r8d, %r11d
cmovgl %r11d, %r8d
imulq $0xc, %rsi, %r11
movl %r8d, (%rdx,%r11)
movl 0x1c(%r9), %r9d
cmpl %r10d, %r9d
cmovll %r9d, %r10d
movl %r10d, %r11d
imulq $0xc, %rsi, %r9
incq %rsi
movl %r11d, 0x4(%rdx,%r9)
cmpl %r11d, %r8d
jle 0x7a4c2
leaq 0x3ddeb2(%rip), %rdi # 0x45842a
leaq 0x3dfd2a(%rip), %rsi # 0x45a2a9
leaq 0x3dfcc1(%rip), %rdx # 0x45a247
leaq 0x3dfd31(%rip), %rcx # 0x45a2be
callq 0x2813f
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3dde82(%rip), %rdi # 0x45842a
leaq 0x3dfc7e(%rip), %rsi # 0x45a22d
leaq 0x3dfc91(%rip), %rdx # 0x45a247
leaq 0x3dfce9(%rip), %rcx # 0x45a2a6
callq 0x2813f
movq %r13, %rdi
movq %rax, %r14
callq 0x29066
jmp 0x7a5d2
movq %rax, %r14
movq 0x8(%rsp), %rdi
callq 0x7ad46
jmp 0x7a5e1
movq %rax, %r14
movq 0x10(%rsp), %rdi
callq 0x7ad60
jmp 0x7a5f0
movq %rax, %r14
movq %rbx, %rdi
callq 0x28fb6
jmp 0x7a5fd
movq %rax, %r14
movq 0x18(%rsp), %rdi
callq 0x3a954
movq %r14, %rdi
callq 0xb3d0
nop
| /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;
if (m_kappa_append[ctx.thread_id] < ctx.init_kappa_improve_stop) {
m_kappa_append[ctx.thread_id] += ctx.init_kappa_improve_increase;
kappa = kappa_min +
(kappa_max - kappa_min) * m_kappa_append[ctx.thread_id];
to_log(stdout, 5u, "- improve with kappa {}\n", kappa);
} else {
m_kappa_append[ctx.thread_id] = ctx.init_kappa_improve_start;
crossover(ctx, x);
to_log(stdout, 5u, "- crossover\n");
}
mutation(ctx, x);
return kappa;
} | 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
callq 0x3be57
vmovsd 0x10(%rsp), %xmm2
vmovsd %xmm2, (%rsp)
movl 0xa0(%r14), %eax
movq 0xa8(%r15), %rcx
vmovsd 0x98(%r14), %xmm1
vmovsd (%rcx,%rax,8), %xmm0
vucomisd %xmm0, %xmm1
jbe 0x7a6be
vaddsd 0x90(%r14), %xmm0, %xmm0
vmovsd 0x8(%rsp), %xmm1
movq %rsp, %r8
vsubsd %xmm2, %xmm1, %xmm1
vmovsd %xmm0, (%rcx,%rax,8)
leaq 0x3dfcd9(%rip), %rcx # 0x45a37c
vfmadd213sd %xmm2, %xmm0, %xmm1 # xmm1 = (xmm0 * xmm1) + xmm2
movq (%r12), %rdi
vmovsd %xmm1, (%r8)
pushq $0x5
popq %rsi
pushq $0x18
popq %rdx
callq 0x3bea4
jmp 0x7a6f1
vmovsd 0x88(%r14), %xmm0
leaq 0x8(%r15), %rdi
movq %r14, %rsi
movq %rbx, %rdx
vmovsd %xmm0, (%rcx,%rax,8)
callq 0x7aef0
movq (%r12), %rdi
leaq 0x3dfcaf(%rip), %rcx # 0x45a395
pushq $0x5
popq %rsi
pushq $0xc
popq %rdx
callq 0x377fc
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x7ad96
vmovsd (%rsp), %xmm0
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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>> const&, baryonyx::bit_array const&) | 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_parameters::constraint_order::pi_sign_change:
std::iota(R.begin(), R.end(), 0);
break;
case solver_parameters::constraint_order::none:
case solver_parameters::constraint_order::reversing:
case solver_parameters::constraint_order::random_sorting:
case solver_parameters::constraint_order::lagrangian_decr:
case solver_parameters::constraint_order::lagrangian_incr:
default:
compute_violated_constraints(s, x, R);
break;
}
} | 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 %rax, %rdx
jmp 0x7b2ec
retq
| /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<double>>&, baryonyx::bit_array&, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, double, double, double) | 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:
solver.compute_update_row(
x, R.crbegin(), R.crend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::random_sorting:
std::shuffle(R.begin(), R.end(), rng);
solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::infeasibility_decr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return rhs.second < lhs.second;
});
solver.compute_update_row(
x, m_order.cbegin(), m_order.cend(), kappa, delta, theta);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::infeasibility_incr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return lhs.second < rhs.second;
});
solver.compute_update_row(
x, m_order.cbegin(), m_order.cend(), kappa, delta, theta);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::lagrangian_decr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[rhs] < solver.pi[lhs];
});
solver.compute_update_row(
x, R.cbegin(), R.cend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::lagrangian_incr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[lhs] < solver.pi[rhs];
});
solver.compute_update_row(
x, R.cbegin(), R.cend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::pi_sign_change:
std::shuffle(R.begin(), R.end(), rng);
pi_changed = solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
remaining = local_compute_violated_constraints(solver, x);
if (!pi_changed && remaining == 0)
return 0;
return remaining;
case solver_parameters::constraint_order::none:
default:
solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
}
} | 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 %r15, %rdi
movq %rbx, %rsi
movq %rax, (%rdx)
movq (%r14), %rax
movq %rax, (%rcx)
callq 0x7b3e2
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
callq 0x7b2ec
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7d6c6
jmp 0x7a8c6
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7cdf0
jmp 0x7a822
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7d25b
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq 0x18(%r14), %rdx
movq 0x20(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7bca0
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7c0f8
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7b848
jmp 0x7a8ea
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7dbb8
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7c1fa
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7b2ec
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7b848
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7c652
nop
| /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::steady_clock::now();
const auto duration = compute_duration(m_start, end);
m_storage.insert(ctx, solution, hash, value, duration, loop);
}
} | 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
callq 0x7e0ae
testb %al, %al
je 0x7a9d7
callq 0xb5a0
subq (%r13), %rax
movq %rbp, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %rcx
movq %rbx, %r8
vcvtsi2sd %rax, %xmm1, %xmm0
vdivsd 0x3df0b4(%rip), %xmm0, %xmm1 # 0x459a80
vmovsd 0x10(%rsp), %xmm0
callq 0x7e12e
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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)) {
const auto end = std::chrono::steady_clock::now();
const auto duration = compute_duration(m_start, end);
m_storage.insert(
ctx, solution, hash, remaining_constraints, duration, loop);
}
} | 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
testb %al, %al
je 0x7aa58
callq 0xb5a0
subq (%r13), %rax
movq 0x10(%rsp), %r9
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %rcx
movl %ebp, %r8d
vcvtsi2sd %rax, %xmm0, %xmm0
vdivsd 0x3df02d(%rip), %xmm0, %xmm0 # 0x459a80
callq 0x7e318
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
| /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_cost_type<double>>&, baryonyx::bit_array&, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, double, double, double, double) | 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;
if (use_cycle)
order = next_state(order);
switch (order) {
case solver_parameters::constraint_order::reversing:
solver.push_and_compute_update_row(x,
R.crbegin(),
R.crend(),
kappa,
delta,
theta,
objective_amplifier);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::random_sorting:
std::shuffle(R.begin(), R.end(), rng);
solver.push_and_compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta, objective_amplifier);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::infeasibility_decr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return rhs.second < lhs.second;
});
solver.push_and_compute_update_row(x,
m_order.cbegin(),
m_order.cend(),
kappa,
delta,
theta,
objective_amplifier);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::infeasibility_incr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return lhs.second < rhs.second;
});
solver.push_and_compute_update_row(x,
m_order.cbegin(),
m_order.cend(),
kappa,
delta,
theta,
objective_amplifier);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::lagrangian_decr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[rhs] < solver.pi[lhs];
});
solver.push_and_compute_update_row(x,
R.cbegin(),
R.cend(),
kappa,
delta,
theta,
objective_amplifier);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::lagrangian_incr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[lhs] < solver.pi[rhs];
});
solver.push_and_compute_update_row(x,
R.cbegin(),
R.cend(),
kappa,
delta,
theta,
objective_amplifier);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::pi_sign_change:
std::shuffle(R.begin(), R.end(), rng);
pi_changed = solver.push_and_compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta, objective_amplifier);
remaining = local_compute_violated_constraints(solver, x);
if (!pi_changed && remaining == 0)
return 0;
return remaining;
case solver_parameters::constraint_order::none:
default:
solver.push_and_compute_update_row(x,
R.cbegin(),
R.cend(),
kappa,
delta,
theta,
objective_amplifier);
return compute_violated_constraints(solver, x, R);
}
} | 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), %rdx # 0x459cb4
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax
leaq 0x28(%rsp), %rdx
leaq 0x20(%rsp), %rcx
movq %r15, %rdi
movq %rbx, %rsi
movq %rax, (%rdx)
movq (%r14), %rax
movq %rax, (%rcx)
callq 0x7e418
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
callq 0x7b2ec
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7ed12
jmp 0x7abf3
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7e43c
jmp 0x7ab4f
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7e8a7
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq 0x18(%r14), %rdx
movq 0x20(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7bca0
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7c0f8
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7b848
jmp 0x7ac17
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x7f204
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7c1fa
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7b2ec
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x7b848
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x7c652
| /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_p = ctx.value_p_dist(ctx.rng);
while (val_p < 0.0 || val_p > 1.0);
to_log(stdout,
7u,
"- mutation variables {}% with "
" {}% of set\n",
var_p,
val_p);
std::bernoulli_distribution dist_var_p(var_p);
std::bernoulli_distribution dist_value_p(val_p);
for (int i = 0, e = x.size(); i != e; ++i) {
if (dist_var_p(ctx.rng)) {
to_log(stdout, 9u, "- mutate variable {}\n", i);
x.set(i, dist_value_p(ctx.rng));
}
}
} | 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
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x48(%r14), %r15
leaq 0x28(%r14), %r12
movq %r12, %rdi
movq %r14, %rsi
callq 0x3c480
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm0, %xmm1
jae 0x7ade0
vucomisd 0x3d923b(%rip), %xmm0 # 0x454038
jae 0x7ade0
vmovsd %xmm0, 0x18(%rsp)
movq %r15, %rdi
movq %r14, %rsi
callq 0x3c480
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm0, %xmm1
ja 0x7ae05
vucomisd 0x3d9216(%rip), %xmm0 # 0x454038
ja 0x7ae05
movq 0x5c219d(%rip), %rax # 0x63cfc8
leaq 0x20(%rsp), %r15
leaq 0x3df5e5(%rip), %rcx # 0x45a41c
vmovsd %xmm0, (%r15)
movq (%rax), %rdi
pushq $0x7
popq %rsi
pushq $0x2a
popq %rdx
leaq 0x18(%rsp), %r12
movq %r15, %r9
movq %r12, %r8
callq 0x3c5d8
vmovsd (%r12), %xmm0
vmovsd (%r15), %xmm1
leaq 0x4(%rsp), %rax
andl $0x0, (%rax)
xorl %eax, %eax
movl (%rbx), %r15d
vmovsd %xmm0, 0x10(%rsp)
vmovsd %xmm1, 0x8(%rsp)
pushq $0x9
popq %rbp
pushq $0x15
popq %r13
cmpl %r15d, %eax
je 0x7adc9
movq %r14, %rdi
callq 0x36ac3
vmovsd 0x10(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x7aee4
movq 0x5c2124(%rip), %rax # 0x63cfc8
leaq 0x3df59c(%rip), %rcx # 0x45a447
leaq 0x4(%rsp), %r8
movl %ebp, %esi
movq %r13, %rdx
movq (%rax), %rdi
callq 0x3c631
movl 0x4(%rsp), %r12d
movq %r14, %rdi
callq 0x36ac3
vmovsd 0x8(%rsp), %xmm1
xorl %edx, %edx
movq %rbx, %rdi
movl %r12d, %esi
vucomisd %xmm0, %xmm1
seta %dl
callq 0x3c67e
movl 0x4(%rsp), %eax
incl %eax
movl %eax, 0x4(%rsp)
jmp 0x7ae80
| /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(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_bastert);
to_log(stdout,
7u,
"- crossover between {} ({}) and bastert\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_bastert;
}
} else {
init_with_random(m_random, ctx.rng, x.size(), 0.5);
if (b(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_random);
to_log(stdout,
7u,
"- crossover between {} ({}) and random\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_random;
}
}
} else {
int first = m_indices[choose_a_solution(ctx)];
int second = m_indices[choose_a_solution(ctx)];
while (first == second)
second = m_indices[choose_a_solution(ctx)];
crossover(ctx, x, m_data[first].x, m_data[second].x);
to_log(stdout,
7u,
"- crossover between {} ({}) and {} ({})\n",
first,
m_data[first].value,
second,
m_data[second].value);
}
} | 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), %rcx
cltq
movl (%rcx,%rax,4), %eax
movl %eax, 0x8(%rsp)
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3dda28(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x7b049
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3dda0e(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x7b0cd
movslq 0x8(%rsp), %rax
leaq 0x68(%rbx), %r8
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x7b168
addq $0x50, %rbx
leaq 0x3df404(%rip), %rcx # 0x45a3a2
pushq $0x28
jmp 0x7b0a4
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7b124
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %r12
movl %r12d, 0x8(%rsp)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7b124
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %rax
movl %eax, 0xc(%rsp)
cmpl %eax, %r12d
jne 0x7afea
movq %rbx, %rdi
movq %r15, %rsi
callq 0x7b124
jmp 0x7afca
movq 0x50(%rbx), %r8
imulq $0x38, %r12, %r12
imulq $0x38, %rax, %r13
leaq (%r8,%r12), %rcx
addq %r13, %r8
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x7b168
movq 0x5c1fb6(%rip), %rax # 0x63cfc8
movq 0x50(%rbx), %rdx
movq (%rax), %rdi
leaq 0x10(%rdx,%r13), %rax
leaq 0x10(%rdx,%r12), %r9
leaq 0xc(%rsp), %r10
leaq 0x3df3c4(%rip), %rcx # 0x45a3f3
pushq $0x7
popq %rsi
pushq $0x28
popq %rdx
leaq 0x8(%rsp), %r8
pushq %rax
pushq %r10
callq 0x3c3e1
popq %rax
popq %rcx
jmp 0x7b0ec
movl (%r14), %edx
leaq 0x78(%rbx), %r12
vmovsd 0x3dd920(%rip), %xmm0 # 0x458978
movq %r12, %rdi
movq %r15, %rsi
callq 0x362ac
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3dd905(%rip), %xmm1 # 0x458978
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
vucomisd %xmm0, %xmm1
jbe 0x7b0e1
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %r8
callq 0x7b168
addq $0x50, %rbx
leaq 0x3df329(%rip), %rcx # 0x45a3cb
pushq $0x27
popq %rdx
movq 0x5c1f1c(%rip), %rax # 0x63cfc8
leaq 0x8(%rsp), %r8
movq (%rbx), %rsi
movslq (%r8), %r9
movq (%rax), %rdi
imulq $0x38, %r9, %rax
leaq 0x10(%rsi,%rax), %r9
pushq $0x7
popq %rsi
callq 0x3c388
jmp 0x7b0ec
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
addq $0x68, %rbx
movq %rbx, %r12
movq %rcx, %rdi
movq %r12, %rsi
callq 0x36a44
leaq 0x10(%rsp), %rdi
callq 0x3c450
addq $0x20, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x7b10e
jmp 0x7b10e
jmp 0x7b10e
jmp 0x7b10e
jmp 0x7b10e
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x3c450
movq %rbx, %rdi
callq 0xb3d0
nop
| /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 auto x2 = second.block(i);
x.set_block(i, ((x1 ^ x2) & ctx.crossover_dist(ctx.rng)) ^ x1);
}
} | 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
movl %ebp, %esi
movq %rax, %rbx
callq 0x377b0
movq %rax, %r14
movq %r13, %rdi
movq %r12, %rsi
callq 0x3709a
andnq %rbx, %rax, %rcx
andq %rax, %r14
orq %rcx, %r14
movq (%rsp), %rcx
movq 0x8(%rcx), %rax
movq %r14, (%rax,%rbp,8)
incq %rbp
jmp 0x7b191
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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::minimize_tag, baryonyx::itm::default_cost_type<double>> const&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x7b2d1
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3c868
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x7b285
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x7b25d
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x7b2a6
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x7b2b7
subl 0x4(%rcx,%rdx), %ebx
jle 0x7b2c4
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x7b232
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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<double>> const&, baryonyx::bit_array const&, std::vector<int, std::allocator<int>>&) | 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, %al
jne 0x7b338
movq %rbx, %rdi
movq %r12, %rsi
callq 0x31460
movl 0x4(%rsp), %esi
incl %esi
jmp 0x7b311
movq 0x8(%rbx), %rax
subq (%rbx), %rax
shrq $0x2, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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>> const&, int, baryonyx::bit_array const&) | 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), %rax
movq 0x48(%rbx), %rcx
movl 0x4(%r13), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r13
addl %eax, %r15d
jmp 0x7b38c
movslq 0x4(%rsp), %rcx
movq 0x58(%rbx), %rax
imulq $0xc, %rcx, %rcx
cmpl %r15d, (%rax,%rcx)
jle 0x7b3cb
xorl %eax, %eax
jmp 0x7b3d3
cmpl 0x4(%rax,%rcx), %r15d
setle %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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 %rdi, 0x8(%rsp)
movq %r14, 0x58(%rsp)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
movq 0x70(%rsp), %rcx
cmpq (%rcx), %rax
je 0x7b7f1
movslq -0x4(%rax), %r13
cmpl 0x80(%r12), %r13d
jge 0x7b805
leaq 0x28(%rsp), %rdi
movq %r14, %rsi
movl %r13d, %edx
callq 0x3de66
vmovsd 0x68(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x7c694
movq 0x30(%rsp), %rbx
xorl %ebp, %ebp
cmpq 0x28(%rsp), %rbx
je 0x7b520
movl 0x4(%rbx), %edx
movq %r15, %rdi
movq %r14, %rsi
callq 0x3dede
movq 0x48(%rsp), %rcx
movq 0x50(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rcx, %rdx
je 0x7b4da
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm1
vfmadd231sd (%rsi,%rdi,8), %xmm1, %xmm0 # xmm0 = (xmm1 * mem) + xmm0
movq %rdx, 0x50(%rsp)
jmp 0x7b4bc
movq 0x50(%r12), %rcx
movq %rbp, %rdx
shlq $0x4, %rdx
movl %ebp, 0x8(%rcx,%rdx)
incq %rbp
movslq (%rbx), %rsi
addq $0x8, %rbx
movl (%rax,%rsi,4), %eax
movl %eax, 0xc(%rcx,%rdx)
movq 0x70(%r12), %rax
movq 0x30(%rsp), %rsi
movslq 0x4(%rsi), %rsi
movq 0x8(%rax), %rax
vmovsd (%rax,%rsi,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rdx)
jmp 0x7b48b
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %ebp, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x7c6b1
movq 0x58(%r12), %rax
imulq $0xc, %r13, %rdx
movq %r13, 0x38(%rsp)
movq %rbp, 0x78(%rsp)
movq %rdx, 0x40(%rsp)
cmpl $0x0, (%rax,%rdx)
jle 0x7b626
leal -0x2(%rbp), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
xorl %r14d, %r14d
cltq
movq %rax, 0x80(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq (%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, 0x10(%rsp)
callq 0x369c8
movq 0x8(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x8(%rsp), %r12
vmovsd 0x3dd3ae(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x40(%rsp), %rdx
cmpl %ebp, 0x10(%rsp)
jle 0x7b614
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x80(%rsp), %rbx
movq %rcx, %rbx
jl 0x7b57d
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7b62c
xorl %eax, %eax
jmp 0x7b633
xorl %ebp, %ebp
pushq $-0x1
popq %r15
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq 0x78(%rsp), %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, 0x10(%rsp)
incq %r15
cmpq 0x10(%rsp), %r15
jae 0x7b749
testb $0x1, %al
je 0x7b749
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x7b682
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x7b6f1
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x7b6f1
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x7b6f1
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3dd2b2(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x7b738
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3dd26d(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x40(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x7b648
movq 0x38(%rsp), %r13
cmpq 0x10(%rsp), %rbx
jae 0x7b7c0
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq (%rsp), %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x8(%rsp), %rax
movq 0x8(%rsp), %rcx
vmovsd 0x3dd1f4(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x8(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x7b74e
movq (%rsp), %rdx
movq %r12, %rdi
movl %r13d, %esi
callq 0x7b357
testb %al, %al
je 0x7b826
movq 0x60(%rsp), %rcx
movq 0x58(%rsp), %r14
leaq 0x48(%rsp), %r15
movq (%rcx), %rax
addq $-0x4, %rax
movq %rax, (%rcx)
jmp 0x7b43c
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3dc9d2(%rip), %rdi # 0x4581de
leaq 0x3dec67(%rip), %rsi # 0x45a47a
leaq 0x3dea2d(%rip), %rdx # 0x45a247
leaq 0x3dec5f(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3dc9b1(%rip), %rdi # 0x4581de
leaq 0x3dec50(%rip), %rsi # 0x45a484
leaq 0x3dea0c(%rip), %rdx # 0x45a247
leaq 0x3dec63(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x68(%rsp), %rdx
je 0x7bc4a
movslq (%rdx), %r13
cmpl 0x80(%r12), %r13d
jge 0x7bc5e
leaq 0x28(%rsp), %rdi
movq %rdx, 0x70(%rsp)
movq %r14, %rsi
movl %r13d, %edx
callq 0x3de66
vmovsd 0x60(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x7c694
movq 0x30(%rsp), %rbx
xorl %ebp, %ebp
cmpq 0x28(%rsp), %rbx
je 0x7b97f
movl 0x4(%rbx), %edx
movq %r15, %rdi
movq %r14, %rsi
callq 0x3dede
movq 0x48(%rsp), %rcx
movq 0x50(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rcx, %rdx
je 0x7b939
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm1
vfmadd231sd (%rsi,%rdi,8), %xmm1, %xmm0 # xmm0 = (xmm1 * mem) + xmm0
movq %rdx, 0x50(%rsp)
jmp 0x7b91b
movq 0x50(%r12), %rcx
movq %rbp, %rdx
shlq $0x4, %rdx
movl %ebp, 0x8(%rcx,%rdx)
incq %rbp
movslq (%rbx), %rsi
addq $0x8, %rbx
movl (%rax,%rsi,4), %eax
movl %eax, 0xc(%rcx,%rdx)
movq 0x70(%r12), %rax
movq 0x30(%rsp), %rsi
movslq 0x4(%rsi), %rsi
movq 0x8(%rax), %rax
vmovsd (%rax,%rsi,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rdx)
jmp 0x7b8ea
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %ebp, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x7c6b1
movq 0x58(%r12), %rax
imulq $0xc, %r13, %rdx
movq %r13, 0x38(%rsp)
movq %rbp, 0x78(%rsp)
movq %rdx, 0x40(%rsp)
cmpl $0x0, (%rax,%rdx)
jle 0x7ba85
leal -0x2(%rbp), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
xorl %r14d, %r14d
cltq
movq %rax, 0x80(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq (%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, 0x10(%rsp)
callq 0x369c8
movq 0x8(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x8(%rsp), %r12
vmovsd 0x3dcf4f(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x40(%rsp), %rdx
cmpl %ebp, 0x10(%rsp)
jle 0x7ba73
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x80(%rsp), %rbx
movq %rcx, %rbx
jl 0x7b9dc
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7ba8b
xorl %eax, %eax
jmp 0x7ba92
xorl %ebp, %ebp
pushq $-0x1
popq %r15
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq 0x78(%rsp), %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, 0x10(%rsp)
incq %r15
cmpq 0x10(%rsp), %r15
jae 0x7bba8
testb $0x1, %al
je 0x7bba8
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x7bae1
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x7bb50
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x7bb50
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x7bb50
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3dce53(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x7bb97
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3dce0e(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x40(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x7baa7
movq 0x38(%rsp), %r13
cmpq 0x10(%rsp), %rbx
jae 0x7bc1f
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq (%rsp), %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x8(%rsp), %rax
movq 0x8(%rsp), %rcx
vmovsd 0x3dcd95(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x8(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x7bbad
movq (%rsp), %rdx
movq %r12, %rdi
movl %r13d, %esi
callq 0x7b357
testb %al, %al
je 0x7bc7f
movq 0x70(%rsp), %rdx
movq 0x58(%rsp), %r14
leaq 0x48(%rsp), %r15
addq $0x4, %rdx
jmp 0x7b89a
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3dc579(%rip), %rdi # 0x4581de
leaq 0x3de80e(%rip), %rsi # 0x45a47a
leaq 0x3de5d4(%rip), %rdx # 0x45a247
leaq 0x3de806(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3dc558(%rip), %rdi # 0x4581de
leaq 0x3de7f7(%rip), %rsi # 0x45a484
leaq 0x3de5b3(%rip), %rdx # 0x45a247
leaq 0x3de80a(%rip), %rcx # 0x45a4a5
callq 0x2813f
| /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_array&, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x68(%rsp), %rdx
je 0x7c0a2
movslq (%rdx), %r13
cmpl 0x80(%r12), %r13d
jge 0x7c0b6
leaq 0x28(%rsp), %rdi
movq %rdx, 0x70(%rsp)
movq %r14, %rsi
movl %r13d, %edx
callq 0x3de66
vmovsd 0x60(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x7c694
movq 0x30(%rsp), %rbx
xorl %ebp, %ebp
cmpq 0x28(%rsp), %rbx
je 0x7bdd7
movl 0x4(%rbx), %edx
movq %r15, %rdi
movq %r14, %rsi
callq 0x3dede
movq 0x48(%rsp), %rcx
movq 0x50(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rcx, %rdx
je 0x7bd91
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm1
vfmadd231sd (%rsi,%rdi,8), %xmm1, %xmm0 # xmm0 = (xmm1 * mem) + xmm0
movq %rdx, 0x50(%rsp)
jmp 0x7bd73
movq 0x50(%r12), %rcx
movq %rbp, %rdx
shlq $0x4, %rdx
movl %ebp, 0x8(%rcx,%rdx)
incq %rbp
movslq (%rbx), %rsi
addq $0x8, %rbx
movl (%rax,%rsi,4), %eax
movl %eax, 0xc(%rcx,%rdx)
movq 0x70(%r12), %rax
movq 0x30(%rsp), %rsi
movslq 0x4(%rsi), %rsi
movq 0x8(%rax), %rax
vmovsd (%rax,%rsi,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rdx)
jmp 0x7bd42
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %ebp, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x7c6b1
movq 0x58(%r12), %rax
imulq $0xc, %r13, %rdx
movq %r13, 0x38(%rsp)
movq %rbp, 0x78(%rsp)
movq %rdx, 0x40(%rsp)
cmpl $0x0, (%rax,%rdx)
jle 0x7bedd
leal -0x2(%rbp), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
xorl %r14d, %r14d
cltq
movq %rax, 0x80(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq (%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, 0x10(%rsp)
callq 0x369c8
movq 0x8(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x8(%rsp), %r12
vmovsd 0x3dcaf7(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x40(%rsp), %rdx
cmpl %ebp, 0x10(%rsp)
jle 0x7becb
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x80(%rsp), %rbx
movq %rcx, %rbx
jl 0x7be34
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7bee3
xorl %eax, %eax
jmp 0x7beea
xorl %ebp, %ebp
pushq $-0x1
popq %r15
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq 0x78(%rsp), %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, 0x10(%rsp)
incq %r15
cmpq 0x10(%rsp), %r15
jae 0x7c000
testb $0x1, %al
je 0x7c000
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x7bf39
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x7bfa8
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x7bfa8
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x7bfa8
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3dc9fb(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x7bfef
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3dc9b6(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x40(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x7beff
movq 0x38(%rsp), %r13
cmpq 0x10(%rsp), %rbx
jae 0x7c077
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq (%rsp), %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x8(%rsp), %rax
movq 0x8(%rsp), %rcx
vmovsd 0x3dc93d(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x8(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x7c005
movq (%rsp), %rdx
movq %r12, %rdi
movl %r13d, %esi
callq 0x7b357
testb %al, %al
je 0x7c0d7
movq 0x70(%rsp), %rdx
movq 0x58(%rsp), %r14
leaq 0x48(%rsp), %r15
addq $0x8, %rdx
jmp 0x7bcf2
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3dc121(%rip), %rdi # 0x4581de
leaq 0x3de3b6(%rip), %rsi # 0x45a47a
leaq 0x3de17c(%rip), %rdx # 0x45a247
leaq 0x3de3ae(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3dc100(%rip), %rdi # 0x4581de
leaq 0x3de39f(%rip), %rsi # 0x45a484
leaq 0x3de15b(%rip), %rdx # 0x45a247
leaq 0x3de3b2(%rip), %rcx # 0x45a4a5
callq 0x2813f
| /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_tag, baryonyx::itm::default_cost_type<double>>&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x7c1df
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3de66
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x7c193
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x7c16b
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x7c1b4
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x7c1c5
subl 0x4(%rcx,%rdx), %ebx
jle 0x7c1d2
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x7c140
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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*, std::vector<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x68(%rsp), %rdx
je 0x7c5fc
movslq (%rdx), %r13
cmpl 0x80(%r12), %r13d
jge 0x7c610
leaq 0x28(%rsp), %rdi
movq %rdx, 0x70(%rsp)
movq %r14, %rsi
movl %r13d, %edx
callq 0x3de66
vmovsd 0x60(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x7c694
movq 0x30(%rsp), %rbx
xorl %ebp, %ebp
cmpq 0x28(%rsp), %rbx
je 0x7c331
movl 0x4(%rbx), %edx
movq %r15, %rdi
movq %r14, %rsi
callq 0x3dede
movq 0x48(%rsp), %rcx
movq 0x50(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rcx, %rdx
je 0x7c2eb
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm1
vfmadd231sd (%rsi,%rdi,8), %xmm1, %xmm0 # xmm0 = (xmm1 * mem) + xmm0
movq %rdx, 0x50(%rsp)
jmp 0x7c2cd
movq 0x50(%r12), %rcx
movq %rbp, %rdx
shlq $0x4, %rdx
movl %ebp, 0x8(%rcx,%rdx)
incq %rbp
movslq (%rbx), %rsi
addq $0x8, %rbx
movl (%rax,%rsi,4), %eax
movl %eax, 0xc(%rcx,%rdx)
movq 0x70(%r12), %rax
movq 0x30(%rsp), %rsi
movslq 0x4(%rsi), %rsi
movq 0x8(%rax), %rax
vmovsd (%rax,%rsi,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rdx)
jmp 0x7c29c
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %ebp, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x7c6b1
movq 0x58(%r12), %rax
imulq $0xc, %r13, %rdx
movq %r13, 0x38(%rsp)
movq %rbp, 0x78(%rsp)
movq %rdx, 0x40(%rsp)
cmpl $0x0, (%rax,%rdx)
jle 0x7c437
leal -0x2(%rbp), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
xorl %r14d, %r14d
cltq
movq %rax, 0x80(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq (%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, 0x10(%rsp)
callq 0x369c8
movq 0x8(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x8(%rsp), %r12
vmovsd 0x3dc59d(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x40(%rsp), %rdx
cmpl %ebp, 0x10(%rsp)
jle 0x7c425
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x80(%rsp), %rbx
movq %rcx, %rbx
jl 0x7c38e
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x7c43d
xorl %eax, %eax
jmp 0x7c444
xorl %ebp, %ebp
pushq $-0x1
popq %r15
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq 0x78(%rsp), %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, 0x10(%rsp)
incq %r15
cmpq 0x10(%rsp), %r15
jae 0x7c55a
testb $0x1, %al
je 0x7c55a
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x7c493
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x7c502
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x7c502
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x7c502
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3dc4a1(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x7c549
movl 0x4(%r13), %esi
movq (%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3dc45c(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x40(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x7c459
movq 0x38(%rsp), %r13
cmpq 0x10(%rsp), %rbx
jae 0x7c5d1
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq (%rsp), %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x8(%rsp), %rax
movq 0x8(%rsp), %rcx
vmovsd 0x3dc3e3(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x8(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x7c55f
movq (%rsp), %rdx
movq %r12, %rdi
movl %r13d, %esi
callq 0x7b357
testb %al, %al
je 0x7c631
movq 0x70(%rsp), %rdx
movq 0x58(%rsp), %r14
leaq 0x48(%rsp), %r15
addq $0x4, %rdx
jmp 0x7c24c
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3dbbc7(%rip), %rdi # 0x4581de
leaq 0x3dde5c(%rip), %rsi # 0x45a47a
leaq 0x3ddc22(%rip), %rdx # 0x45a247
leaq 0x3dde54(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3dbba6(%rip), %rdi # 0x4581de
leaq 0x3dde45(%rip), %rsi # 0x45a484
leaq 0x3ddc01(%rip), %rdx # 0x45a247
leaq 0x3dde58(%rip), %rcx # 0x45a4a5
callq 0x2813f
| /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::itm::default_cost_type<double>> const&, baryonyx::bit_array const&) | 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
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
| /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_data*, baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::rc_data*, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&) | 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;
}
}
std::shuffle(ret, begin, rng);
} | 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 %rbx, %rdx
callq 0x7cc6b
popq %rbx
popq %r14
popq %r15
retq
jmp 0x7c75a
movq %rax, %rdi
callq 0xeb9f
| /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_data[i].hash == hash)
return false;
return true;
} | 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
vmovsd 0x10(%rcx,%rdx), %xmm0
vucomisd %xmm1, %xmm0
jne 0x7e106
jp 0x7e106
cmpq %rbx, 0x20(%rcx,%rdx)
je 0x7e10c
addq $0x38, %rdx
jmp 0x7e0e5
cmpq %rdx, %rax
leaq 0x8(%rsp), %rdi
sete %bl
callq 0x3c450
movl %ebx, %eax
addq $0x18, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rdi
callq 0xeb9f
| /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: {}) {}s in {} loops\n",
value,
hash,
duration,
loop);
int id_to_delete = m_indices[choose_a_bad_solution(ctx)];
to_log(stdout,
5u,
"- delete {} ({})\n",
id_to_delete,
m_data[id_to_delete].value);
replace_result(id_to_delete, x, value, duration, hash, loop, 0);
sort();
} | 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 (%r12), %rdi
leaq 0x3dc353(%rip), %rcx # 0x45a4ca
pushq $0x5
popq %rsi
pushq $0x30
popq %rdx
movq %rax, %r8
pushq %r11
pushq %r10
callq 0x3fb9e
popq %rax
popq %rcx
leaq 0x68(%r15), %rdi
movq %r15, %rsi
callq 0x3fce2
movq 0x38(%rbx), %rcx
cltq
leaq 0x4(%rsp), %r8
movq (%r12), %rdi
movslq (%rcx,%rax,4), %rax
movl %eax, (%r8)
imulq $0x38, %rax, %rax
movq 0x50(%rbx), %rcx
leaq 0x10(%rcx,%rax), %r9
leaq 0x3dc33a(%rip), %rcx # 0x45a4fb
pushq $0x5
popq %rsi
pushq $0x11
popq %rdx
callq 0x3c388
vmovsd 0x18(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
movl 0x4(%rsp), %esi
movq 0x20(%rsp), %rcx
movq 0x8(%rsp), %r8
movq %rbx, %rdi
movq %r14, %rdx
xorl %r9d, %r9d
callq 0x7e210
movq %rbx, %rdi
callq 0x78a40
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
| /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) noexcept
{
m_indices_reader lock{ m_indices_mutex };
m_data[id].x = x;
m_data[id].value = value;
m_data[id].duration = duration;
m_data[id].hash = hash;
m_data[id].loop = loop;
m_data[id].remaining_constraints = remaining_constraints;
} | 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, %rax
imulq $0x38, %rax, %rbp
addq %rbp, %rdi
movq %r13, %rsi
callq 0x36a44
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
movq 0x50(%r12), %rax
leaq 0x18(%rsp), %rdi
vmovsd %xmm0, 0x10(%rax,%rbp)
vmovsd %xmm1, 0x18(%rax,%rbp)
movq %r15, 0x20(%rax,%rbp)
movq %r14, 0x28(%rax,%rbp)
movl %ebx, 0x30(%rax,%rbp)
callq 0x3c450
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rdi
callq 0xeb9f
nop
| /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;
return true;
} | 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(%rcx,%rdx)
je 0x7e2f6
addq $0x38, %rdx
jmp 0x7e2de
cmpq %rdx, %rax
movq %rsp, %rdi
sete %bl
callq 0x3c450
movl %ebx, %eax
addq $0x10, %rsp
popq %rbx
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
| /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 advance {} (hash: {}) {}s in {} loops\n",
remaining_constraints,
hash,
duration,
loop);
int id_to_delete = m_indices[choose_a_bad_solution(ctx)];
to_log(stdout,
5u,
"- delete {} ({})\n",
id_to_delete,
m_data[id_to_delete].value);
replace_result(id_to_delete,
x,
costs.results(x, cost_constant),
duration,
hash,
loop,
remaining_constraints);
sort();
} | 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 %r9, (%r13)
movq (%r12), %rdi
leaq 0x3dc1a9(%rip), %rcx # 0x45a50d
pushq $0x5
popq %rsi
pushq $0x2f
popq %rdx
movq %r10, %r8
movq %rax, %r9
pushq %r13
pushq %r11
callq 0x3ff5c
popq %rax
popq %rcx
leaq 0x68(%r15), %rdi
movq %r15, %rsi
callq 0x3fce2
movq 0x38(%rbx), %rcx
cltq
leaq 0x8(%rsp), %r8
movq (%r12), %rdi
movslq (%rcx,%rax,4), %rax
movl %eax, (%r8)
imulq $0x38, %rax, %rax
movq 0x50(%rbx), %rcx
leaq 0x10(%rcx,%rax), %r9
leaq 0x3dc14a(%rip), %rcx # 0x45a4fb
pushq $0x5
popq %rsi
pushq $0x11
popq %rdx
callq 0x3c388
vmovsd 0x90(%rbx), %xmm0
movl 0x8(%rsp), %ebp
movq 0x88(%rbx), %rdi
movq %r14, %rsi
callq 0x62f18
vmovsd 0x18(%rsp), %xmm1
movq 0x20(%rsp), %rcx
movq 0x10(%rsp), %r8
movl 0xc(%rsp), %r9d
movq %rbx, %rdi
movl %ebp, %esi
movq %r14, %rdx
callq 0x7e210
movq %rbx, %rdi
callq 0x78a40
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rdi
callq 0xeb9f
| /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;
value = m_data[id].value;
duration = m_data[id].duration;
loop = m_data[id].loop;
} | 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(%rcx,%rax), %edx
movl %edx, (%r12)
vmovsd 0x10(%rcx,%rax), %xmm0
vmovsd %xmm0, (%r15)
vmovsd 0x18(%rcx,%rax), %xmm0
vmovsd %xmm0, (%r14)
movq 0x28(%rcx,%rax), %rax
movq %rax, (%rbx)
callq 0x3c450
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
nop
| /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,
m_data[m_indices[i]].remaining_constraints,
m_data[m_indices[i]].hash);
} | 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 %r12d, %r12d
xorl %r13d, %r13d
movl 0x98(%r14), %eax
cmpq %rax, %r13
je 0x7f849
movq 0x38(%r14), %rdx
movq 0x50(%r14), %rax
movq %rbx, %rdi
movslq (%rdx,%r12), %rcx
addq %r12, %rdx
imulq $0x38, %rcx, %rsi
leaq 0x10(%rax,%rsi), %rcx
leaq 0x30(%rax,%rsi), %r8
leaq 0x20(%rax,%rsi), %r9
movq %r15, %rsi
callq 0x41567
incq %r13
addq $0x4, %r12
jmp 0x7f807
addq $0x10, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
nop
| /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, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::default_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x70(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x64935
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x7f968
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x70(%rsp), %rsi
movl %ebx, %edx
callq 0x64a13
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0x88(%rsp)
vmovsd %xmm1, 0x80(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xc8(%rsp), %rdi
leaq 0x70(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x7a3e8
movl 0xcc(%r12), %esi
leaq 0x90(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x150(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x7fa48
cmpl $0x1, %eax
je 0x7fa22
cmpl $0x2, %eax
jne 0x7fa59
movq 0x18(%r14), %rdx
leaq 0x150(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x7fa33
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x150(%rsp), %rsi
vmovsd 0x3d45fd(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x78789
jmp 0x7fa59
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x7871d
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x7fa8e
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x7fa8a
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x7fa68
leaq 0x158(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
movl 0x148(%rsp), %ecx
movl 0x14c(%rsp), %r8d
movq 0xb0(%r12), %r9
vmovsd %xmm0, (%rsp)
leaq 0x3daab2(%rip), %rdx # 0x45a577
leaq 0x150(%rsp), %rdi
pushq $0x3
popq %rsi
callq 0x42b5a
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0x90(%rsp), %rdi
leaq 0xc8(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x7a710
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %r13
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x7fbf2
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0x90(%rsp), %rdi
leaq 0xc8(%rsp), %rsi
movq %r13, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
movq 0x130(%rsp), %rdx
movq 0x128(%rsp), %rcx
movl %eax, %ebx
leaq 0x150(%rsp), %rdi
leaq 0xd0(%rsp), %rsi
callq 0x6c2be
testl %ebx, %ebx
je 0x7fc94
cmpl %ebp, %ebx
jge 0x7fb92
movq %r14, %rdi
movq %r13, %rsi
movl %ebx, %edx
movq %r15, %rcx
callq 0x80b98
movl %ebx, %ebp
cmpq 0x48(%rsp), %r15
jle 0x7fbc7
vcvtsi2sd %ebx, %xmm3, %xmm0
vcvtsi2sdl 0x148(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x7fbcc
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x7fbf2
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80bd0
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x7fbf2
incq %r15
jmp 0x7fb12
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x7fc14
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x7fc42
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x4f485
leaq 0x150(%rsp), %rdi
callq 0x42cbc
leaq 0x90(%rsp), %rdi
callq 0x393ac
leaq 0xc8(%rsp), %rdi
callq 0x7ac8a
leaq 0x78(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x3a8, %rsp # imm = 0x3A8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x62f18
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x80b4a
vmovsd (%rsp), %xmm0
leaq 0xc8(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x7fc01
vmovsd %xmm0, (%rsp)
vmulsd 0x88(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x80(%rsp), %xmm3
leaq 0x90(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7aa68
testl %eax, %eax
jne 0x7fd50
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80b4a
movq %r14, %rdi
callq 0x80bd0
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x7fc01
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x7fe51
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0x90(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
testl %eax, %eax
je 0x7fe15
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x7fdeb
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x148(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x7fdf0
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x7fe51
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80bd0
testb %al, %al
jne 0x7fe4c
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x7fd6e
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80b4a
vmovsd (%rsp), %xmm0
jmp 0x7fe51
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x7fcd6
jmp 0x7fe97
jmp 0x7fe70
jmp 0x7fe97
movq %rax, %r14
jmp 0x7fea7
movq %rax, %r14
jmp 0x7feb4
movq %rax, %r14
jmp 0x7fec1
movq %rax, %r14
jmp 0x7fecb
movq %rax, %r14
jmp 0x7fed5
jmp 0x7fe97
jmp 0x7fe97
jmp 0x7fe97
leaq 0x158(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x7fea7
leaq 0x150(%rsp), %rdi
movq %rax, %r14
callq 0x42cbc
leaq 0x90(%rsp), %rdi
callq 0x393ac
leaq 0xc8(%rsp), %rdi
callq 0x7ac8a
leaq 0x78(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
nop
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::default_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x70(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x64935
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x7ffd0
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x70(%rsp), %rsi
movl %ebx, %edx
callq 0x64a13
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0x88(%rsp)
vmovsd %xmm1, 0x80(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xc8(%rsp), %rdi
leaq 0x70(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x7a3e8
movl 0xcc(%r12), %esi
leaq 0x90(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x150(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x800b0
cmpl $0x1, %eax
je 0x8008a
cmpl $0x2, %eax
jne 0x800c1
movq 0x18(%r14), %rdx
leaq 0x150(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x8009b
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x150(%rsp), %rsi
vmovsd 0x3d3f95(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x78789
jmp 0x800c1
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x7871d
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x800f6
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x800f2
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x800d0
leaq 0x158(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
movl 0x148(%rsp), %ecx
movl 0x14c(%rsp), %r8d
movq 0xb0(%r12), %r9
vmovsd %xmm0, (%rsp)
leaq 0x3da44a(%rip), %rdx # 0x45a577
leaq 0x150(%rsp), %rdi
pushq $0x3
popq %rsi
callq 0x4346e
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0x90(%rsp), %rdi
leaq 0xc8(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x7a710
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %r13
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x8025a
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0x90(%rsp), %rdi
leaq 0xc8(%rsp), %rsi
movq %r13, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
movq 0x130(%rsp), %rdx
movq 0x128(%rsp), %rcx
movl %eax, %ebx
leaq 0x150(%rsp), %rdi
leaq 0xd0(%rsp), %rsi
callq 0x6c6c0
testl %ebx, %ebx
je 0x802fc
cmpl %ebp, %ebx
jge 0x801fa
movq %r14, %rdi
movq %r13, %rsi
movl %ebx, %edx
movq %r15, %rcx
callq 0x80c7e
movl %ebx, %ebp
cmpq 0x48(%rsp), %r15
jle 0x8022f
vcvtsi2sd %ebx, %xmm3, %xmm0
vcvtsi2sdl 0x148(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x80234
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x8025a
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80cb6
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x8025a
incq %r15
jmp 0x8017a
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x8027c
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x802aa
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x4f485
leaq 0x150(%rsp), %rdi
callq 0x435d0
leaq 0x90(%rsp), %rdi
callq 0x393ac
leaq 0xc8(%rsp), %rdi
callq 0x7ac8a
leaq 0x78(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x3a8, %rsp # imm = 0x3A8
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x62f18
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x80c30
vmovsd (%rsp), %xmm0
leaq 0xc8(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x80269
vmovsd %xmm0, (%rsp)
vmulsd 0x88(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x80(%rsp), %xmm3
leaq 0x90(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7aa68
testl %eax, %eax
jne 0x803b8
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80c30
movq %r14, %rdi
callq 0x80cb6
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x80269
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x804b9
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0x90(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
testl %eax, %eax
je 0x8047d
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x80453
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x148(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x80458
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x804b9
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80cb6
testb %al, %al
jne 0x804b4
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x803d6
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80c30
vmovsd (%rsp), %xmm0
jmp 0x804b9
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x8033e
jmp 0x804ff
jmp 0x804d8
jmp 0x804ff
movq %rax, %r14
jmp 0x8050f
movq %rax, %r14
jmp 0x8051c
movq %rax, %r14
jmp 0x80529
movq %rax, %r14
jmp 0x80533
movq %rax, %r14
jmp 0x8053d
jmp 0x804ff
jmp 0x804ff
jmp 0x804ff
leaq 0x158(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x8050f
leaq 0x150(%rsp), %rdi
movq %rax, %r14
callq 0x435d0
leaq 0x90(%rsp), %rdi
callq 0x393ac
leaq 0xc8(%rsp), %rdi
callq 0x7ac8a
leaq 0x78(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
nop
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::default_cost_type<double> const&, double) | 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.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const long int w_limit = static_cast<long int>(p.w);
Solver slv(
m_rng, length(constraints), variables, norm_costs, constraints);
compute_order compute(p.order, variables);
{
std::bernoulli_distribution choose_mutation(
m_ctx.parameters.init_policy_random);
bit_array empty_x;
switch (p.init_policy) {
case solver_parameters::init_policy_type::pessimistic_solve:
init_with_pre_solve<Cost, Mode>(
x, empty_x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::optimistic_solve:
init_with_pre_solve<Cost, Mode>(
empty_x, x, m_rng, original_costs, constraints, 1.0);
break;
case solver_parameters::init_policy_type::bastert:
init_with_bastert<Cost, Mode>(x, original_costs, variables, 0);
break;
}
for (int i = 0, e = x.size(); i != e; ++i)
if (choose_mutation(m_rng))
x.invert(i);
}
bool start_push = false;
auto kappa = static_cast<Float>(p.kappa_min);
Observer obs("img", slv.m, slv.n, p.limit);
m_begin = std::chrono::steady_clock::now();
m_end = std::chrono::steady_clock::now();
compute.init(slv, x);
for (long int i = 0; i != p.limit; ++i) {
auto remaining = compute.run(slv, x, m_rng, kappa, delta, theta);
obs.make_observation(slv.ap, slv.P.get(), slv.pi.get());
if (remaining == 0) {
store_if_better(
x, original_costs.results(x, cost_constant), i);
best_remaining = remaining;
start_push = true;
break;
}
if (remaining < best_remaining) {
store_if_better(x, remaining, i);
best_remaining = remaining;
}
if (i > w_limit)
kappa += kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max) {
r.status = result_status::kappa_max_reached;
break;
}
if (is_timelimit_reached()) {
r.status = result_status::time_limit_reached;
break;
}
}
if (!start_push) {
r.status = result_status::limit_reached;
} else {
for (int push = 0; push < p.pushes_limit; ++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_rng,
pushing_k_factor * kappa,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0)
store_if_better(x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
if (is_timelimit_reached())
break;
for (int iter = 0; iter < p.pushing_iteration_limit; ++iter) {
remaining =
compute.run(slv, x, m_rng, kappa, delta, theta);
if (remaining == 0) {
store_if_better(
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
if (is_timelimit_reached())
break;
}
}
}
if (m_best.remaining_constraints == 0)
r.status = result_status::success;
if (!m_best.x.empty()) {
r.solutions.resize(1);
convert(m_best, r.solutions[0], variables);
}
return r;
} | 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)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rdi)
leaq 0x18(%rsp), %rdi
movl %ecx, %esi
vzeroupper
callq 0x368ae
movq 0x10(%r14), %r12
movq 0x18(%r14), %rcx
leaq 0x88(%rsp), %rdi
movq %r12, %rsi
movq %r13, %rdx
movl %ebx, %r8d
callq 0x64935
vmovsd 0x20(%r12), %xmm0
vmovsd 0x10(%r12), %xmm1
vmovsd %xmm0, 0x60(%rsp)
vmovsd 0x28(%r12), %xmm0
vmovsd %xmm1, 0x28(%rsp)
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x30(%r12), %xmm0
vmovsd %xmm0, 0x58(%rsp)
vmovsd 0x8(%r12), %xmm0
vmovsd %xmm0, 0x30(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x8063e
movq 0x10(%r14), %rdi
vmovsd 0x30(%rsp), %xmm0
leaq 0x88(%rsp), %rsi
movl %ebx, %edx
callq 0x64a13
vmovsd %xmm0, 0x28(%rsp)
vcvttsd2si 0xa0(%r12), %rax
vmovsd 0x38(%r12), %xmm0
vmovsd 0x40(%r12), %xmm1
movq 0x18(%r14), %rsi
movq %rax, 0x48(%rsp)
movq 0x8(%r15), %rax
vmovsd %xmm0, 0xa0(%rsp)
vmovsd %xmm1, 0x98(%rsp)
subq (%r15), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xe0(%rsp), %rdi
leaq 0x88(%rsp), %r8
movl %eax, %edx
movl %ebx, %ecx
movq %r15, %r9
callq 0x7a3e8
movl 0xcc(%r12), %esi
leaq 0xa8(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq 0x10(%r14), %rax
movl %ebx, 0x54(%rsp)
vmovsd 0x48(%rax), %xmm0
vmovsd %xmm0, (%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vmovapd %xmm0, 0x70(%rsp)
movl 0xd4(%r12), %eax
testl %eax, %eax
je 0x80718
cmpl $0x1, %eax
je 0x806f5
cmpl $0x2, %eax
jne 0x80729
movq 0x18(%r14), %rdx
leaq 0x70(%rsp), %rdi
leaq 0x18(%rsp), %rsi
jmp 0x80703
movq 0x18(%r14), %rdx
leaq 0x18(%rsp), %rdi
leaq 0x70(%rsp), %rsi
vmovsd 0x3d392d(%rip), %xmm0 # 0x454038
movq %r13, %rcx
movq %r15, %r8
callq 0x78789
jmp 0x80729
leaq 0x18(%rsp), %rdi
movq %r13, %rsi
movl %ebx, %edx
xorl %ecx, %ecx
callq 0x7871d
leaq 0x18(%rsp), %r15
movq %r13, 0x38(%rsp)
xorl %ebx, %ebx
movl (%r15), %ebp
cmpl %ebx, %ebp
je 0x8075e
movq 0x18(%r14), %rdi
callq 0x36ac3
vmovsd (%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x8075a
movq %r15, %rdi
movl %ebx, %esi
callq 0x3626e
incl %ebx
jmp 0x80738
leaq 0x78(%rsp), %rdi
callq 0x357fe
vmovsd 0x18(%r12), %xmm0
vmovsd %xmm0, (%rsp)
callq 0xb5a0
movq %rax, (%r14)
callq 0xb5a0
movq %rax, 0x8(%r14)
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
leaq 0x18(%rsp), %rdx
callq 0x7a710
vmovsd (%rsp), %xmm0
movl $0x7fffffff, %ebp # imm = 0x7FFFFFFF
leaq 0x18(%rsp), %rbx
xorl %r15d, %r15d
cmpq 0xb0(%r12), %r15
je 0x80871
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa8(%rsp), %rdi
leaq 0xe0(%rsp), %rsi
movq %rbx, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
movl %eax, %r13d
testl %eax, %eax
je 0x80909
cmpl %ebp, %r13d
jge 0x80810
movq %r14, %rdi
movq %rbx, %rsi
movl %r13d, %edx
movq %r15, %rcx
callq 0x80d64
movl %r13d, %ebp
cmpq 0x48(%rsp), %r15
jle 0x80846
vcvtsi2sd %r13d, %xmm3, %xmm0
vcvtsi2sdl 0x160(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x8084b
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x80871
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80d9c
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x80871
incq %r15
jmp 0x807b1
movq 0x8(%rsp), %rax
movl $0x5, 0xa0(%rax)
cmpl $0x0, 0x50(%r14)
jne 0x80893
movq 0x8(%rsp), %rax
andl $0x0, 0xa0(%rax)
cmpq $0x0, 0x28(%r14)
je 0x808c1
movq 0x8(%rsp), %rax
leaq 0x68(%rax), %rbx
pushq $0x1
popq %rsi
movq %rbx, %rdi
callq 0x35292
movq (%rbx), %rsi
addq $0x20, %r14
movl 0x54(%rsp), %edx
movq %r14, %rdi
callq 0x4f485
leaq 0xa8(%rsp), %rdi
callq 0x393ac
leaq 0xe0(%rsp), %rdi
callq 0x7ac8a
leaq 0x90(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rax
addq $0x168, %rsp # imm = 0x168
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
leaq 0x18(%rsp), %rbx
movq %rbx, %rsi
callq 0x62f18
movq %r14, %rdi
movq %rbx, %rsi
movq %r15, %rdx
callq 0x80d16
vmovsd (%rsp), %xmm0
leaq 0xe0(%rsp), %r15
leaq 0x18(%rsp), %rbp
xorl %ebx, %ebx
movl $0x0, 0x14(%rsp)
cmpl 0xbc(%r12), %ebx
jge 0x80880
vmovsd %xmm0, (%rsp)
vmulsd 0xa0(%rsp), %xmm0, %xmm0
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
vmovsd 0x98(%rsp), %xmm3
leaq 0xa8(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
callq 0x7aa68
testl %eax, %eax
jne 0x809c5
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull %ebx, %eax
notl %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80d16
movq %r14, %rdi
callq 0x80d9c
vmovsd (%rsp), %xmm0
testb %al, %al
jne 0x80880
movl %ebx, 0x48(%rsp)
pushq $0x1
popq %rax
movl %eax, %ebx
leal -0x1(%rbx), %r13d
cmpl 0xc0(%r12), %r13d
jge 0x80ac6
movq 0x18(%r14), %rcx
vmovsd 0x28(%rsp), %xmm1
vmovsd 0x30(%rsp), %xmm2
leaq 0xa8(%rsp), %rdi
movq %r15, %rsi
movq %rbp, %rdx
vmovsd %xmm0, (%rsp)
callq 0x7a752
testl %eax, %eax
je 0x80a8a
vcvtsi2sd %r13d, %xmm4, %xmm0
vucomisd 0xa0(%r12), %xmm0
jbe 0x80a60
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x160(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x58(%rsp), %xmm1
callq 0xb1f0
vmovsd (%rsp), %xmm1
vfmadd231sd 0x60(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x80a65
vmovsd (%rsp), %xmm0
vucomisd 0x68(%rsp), %xmm0
ja 0x80ac6
movq %r14, %rdi
vmovsd %xmm0, (%rsp)
callq 0x80d9c
testb %al, %al
jne 0x80ac1
vmovsd (%rsp), %xmm0
incl %ebx
jmp 0x809e3
vmovsd 0x40(%rsp), %xmm0
movq 0x38(%rsp), %rdi
movq %rbp, %rsi
callq 0x62f18
movl 0xc0(%r12), %eax
imull 0x14(%rsp), %eax
subl %ebx, %eax
movslq %eax, %rdx
movq %r14, %rdi
movq %rbp, %rsi
callq 0x80d16
vmovsd (%rsp), %xmm0
jmp 0x80ac6
vmovsd (%rsp), %xmm0
movl 0x48(%rsp), %ebx
decl 0x14(%rsp)
incl %ebx
jmp 0x8094b
jmp 0x80b04
jmp 0x80ae0
jmp 0x80b04
movq %rax, %r14
jmp 0x80b14
movq %rax, %r14
jmp 0x80b21
movq %rax, %r14
jmp 0x80b2e
movq %rax, %r14
jmp 0x80b38
jmp 0x80b04
jmp 0x80b04
jmp 0x80b04
leaq 0x78(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
jmp 0x80b07
movq %rax, %r14
leaq 0xa8(%rsp), %rdi
callq 0x393ac
leaq 0xe0(%rsp), %rdi
callq 0x7ac8a
leaq 0x90(%rsp), %rdi
callq 0x29066
leaq 0x20(%rsp), %rdi
callq 0x357fe
movq 0x8(%rsp), %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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, long) | 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)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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, long) | 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)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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, long) | 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)
addq $0x8, %rsp
popq %rbx
popq %r14
retq
nop
| /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
popq %rbx
retq
nop
| /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.resize(1);
r.solutions.back().value = pb.objective.value;
r.strings = pb.strings;
r.affected_vars = pb.affected_vars;
r.variable_name = pb.vars.names;
return r;
}
random_engine rng(init_random_generator_seed(ctx));
auto variables = length(pb.vars.values);
auto cost = Cost(pb.objective, variables);
auto cost_constant = pb.objective.value;
const auto thread = get_thread_number(ctx);
std::vector<optimize_functor<Solver, Float, Mode, Cost>> functors;
std::vector<std::thread> pool(thread);
best_solution_recorder<Cost, Float, Mode> best_recorder(
rng,
thread,
cost,
cost_constant,
variables,
constraints,
ctx.parameters.init_population_size);
auto seeds = generate_seed(rng, thread);
std::atomic_bool stop_task;
stop_task.store(false);
for (unsigned i = 0u; i != thread; ++i)
functors.emplace_back(ctx, i, seeds[i]);
for (unsigned i = 0u; i != thread; ++i)
pool[i] = std::thread(std::ref(functors[i]),
std::ref(stop_task),
std::ref(best_recorder),
std::cref(constraints),
variables,
std::cref(cost),
cost_constant);
const auto start = std::chrono::steady_clock::now();
auto end = start;
do {
std::this_thread::sleep_for(std::chrono::seconds{ 1L });
if (ctx.update) {
auto call_number = 0L;
for (auto i = 0u; i != thread; ++i)
call_number += functors[i].m_call_number;
int constraints_remaining;
long int loop;
double value;
double duration;
best_recorder.get_best(
constraints_remaining, value, duration, loop);
ctx.update(
constraints_remaining, value, loop, duration, call_number);
}
end = std::chrono::steady_clock::now();
} while (!is_time_limit(ctx.parameters.time_limit, start, end));
stop_task.store(true);
for (auto& t : pool)
t.join();
r.strings = pb.strings;
r.affected_vars = pb.affected_vars;
r.variable_name = pb.vars.names;
r.variables = variables;
r.constraints = length(constraints);
const auto& first = best_recorder.get_best(0);
if (!first.is_solution())
r.status = result_status::time_limit_reached;
else
r.status = result_status::success;
r.duration = first.duration;
r.loop = first.loop;
r.remaining_constraints = first.remaining_constraints;
switch (ctx.parameters.storage) {
case solver_parameters::storage_type::one: {
r.solutions.resize(1);
convert(first, r.solutions[0], variables);
} break;
case solver_parameters::storage_type::bound: {
r.solutions.resize(2);
convert(first, r.solutions[0], variables);
convert(best_recorder.get_worst(), r.solutions[1], variables);
} break;
case solver_parameters::storage_type::five: {
r.solutions.resize(5);
for (int i = 0; i != 5; ++i)
convert(best_recorder.get_best(i), r.solutions[i], variables);
} break;
}
best_recorder.show_population(ctx);
if (ctx.finish)
ctx.finish(r);
return r;
} | 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, 0xa0(%rdi)
cmpq $0x0, 0x128(%rsi)
je 0x80e61
leaq 0x118(%r15), %rdi
movq %r15, %rsi
vzeroupper
callq 0x3527e
leaq 0x48(%rsp), %rdi
movq %r15, %rsi
movq %r13, %rdx
vzeroupper
callq 0x450078
movq 0x48(%rsp), %rax
cmpq 0x50(%rsp), %rax
je 0x80fc0
movq 0xa8(%r13), %rax
cmpq 0xb0(%r13), %rax
je 0x80fc0
movq %r15, %rdi
callq 0x353ba
movl $0x7fffffff, %ecx # imm = 0x7FFFFFFF
xorl %edx, %edx
divq %rcx
cmpq $0x1, %rdx
adcq $0x0, %rdx
movq %rdx, 0x40(%rsp)
movq 0xb0(%r13), %rax
subq 0xa8(%r13), %rax
pushq $0xc
popq %rcx
cqto
leaq 0x10(%r13), %rsi
idivq %rcx
movl %eax, 0x4(%rsp)
leaq 0xb8(%rsp), %rdi
movl %eax, %edx
movq %r12, 0x10(%rsp)
callq 0x6d526
vmovsd 0x40(%r13), %xmm0
vmovsd %xmm0, 0x38(%rsp)
movq %r15, %rdi
callq 0x35447
andq $0x0, 0x70(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movl %eax, %ebp
vmovapd %xmm0, 0x60(%rsp)
leaq 0xa0(%rsp), %rdi
leaq 0xd8(%rsp), %rdx
movq %rbp, %rsi
callq 0x35462
vmovsd 0x38(%rsp), %xmm0
movl 0xc4(%r15), %eax
movl 0x4(%rsp), %r8d
subq $0x8, %rsp
movl %ebp, %edx
leaq 0xe0(%rsp), %rdi
leaq 0x48(%rsp), %rsi
leaq 0xc0(%rsp), %rcx
leaq 0x50(%rsp), %r9
pushq %rax
callq 0x8177c
popq %rax
popq %rcx
leaq 0x30(%rsp), %rdi
leaq 0x40(%rsp), %rsi
movl %ebp, %edx
callq 0x3551c
xorl %eax, %eax
movb %al, 0x3(%rsp)
xorl %ecx, %ecx
leaq 0x60(%rsp), %rbx
leaq 0x8(%rsp), %r14
xchgb %cl, 0x3(%rsp)
leaq 0x90(%r13), %rcx
movq %rcx, 0x88(%rsp)
movl %eax, 0x8(%rsp)
cmpl %ebp, %eax
je 0x8101b
movl %eax, %ecx
shlq $0x3, %rcx
addq 0x30(%rsp), %rcx
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x817e2
movl 0x8(%rsp), %eax
incl %eax
jmp 0x80f97
andl $0x0, 0xa0(%r12)
leaq 0x68(%r12), %rdi
pushq $0x1
popq %rsi
callq 0x35292
vmovsd 0x40(%r13), %xmm0
movq 0x70(%r12), %rax
vmovsd %xmm0, -0x8(%rax)
movq %r12, %rdi
movq %r13, %rsi
callq 0x31d28
leaq 0xc0(%r13), %rsi
leaq 0x20(%r12), %rdi
callq 0x352c2
addq $0x90, %r13
leaq 0x50(%r12), %rdi
movq %r13, %rsi
callq 0x352ec
jmp 0x813b6
movq %r13, 0x80(%rsp)
movq %r15, %r13
leaq 0x8(%rsp), %r15
leaq 0x98(%rsp), %r14
leaq 0x4(%rsp), %rbx
xorl %r12d, %r12d
cmpq %rbp, %r12
je 0x810df
imulq $0xc0, %r12, %rax
addq 0x60(%rsp), %rax
leaq 0x3(%rsp), %r10
leaq 0xd8(%rsp), %r11
movq %r10, 0x20(%rsp)
leaq 0x48(%rsp), %r10
movq %r11, 0x18(%rsp)
movq %r10, 0x98(%rsp)
movq %rax, 0x28(%rsp)
leaq 0xb8(%rsp), %rax
movq %rax, 0x90(%rsp)
leaq 0x20(%rsp), %rdx
leaq 0x38(%rsp), %rax
movq %r15, %rdi
leaq 0x28(%rsp), %rsi
leaq 0x18(%rsp), %rcx
movq %r14, %r8
movq %rbx, %r9
pushq %rax
leaq 0x98(%rsp), %rax
pushq %rax
callq 0x8182e
popq %rax
popq %rcx
leaq (,%r12,8), %rdi
addq 0xa0(%rsp), %rdi
movq %r15, %rsi
callq 0x356d6
movq %r15, %rdi
callq 0x356f0
incq %r12
jmp 0x8103b
callq 0xb5a0
imulq $0xc0, %rbp, %r15
leaq 0x138(%r13), %r12
leaq 0x8(%rsp), %rbp
movq %rax, %rbx
movq $0x1, 0x8(%rsp)
movq %rbp, %rdi
callq 0x356fd
cmpq $0x0, 0x148(%r13)
je 0x81174
movq 0x60(%rsp), %rax
xorl %ecx, %ecx
xorl %r14d, %r14d
cmpq %rcx, %r15
je 0x81135
addq 0xb0(%rax,%rcx), %r14
addq $0xc0, %rcx
jmp 0x8111f
leaq 0xe0(%rsp), %rdi
leaq 0x18(%rsp), %rsi
leaq 0x28(%rsp), %rdx
leaq 0x20(%rsp), %rcx
movq %rbp, %r8
callq 0x88d36
vmovsd 0x28(%rsp), %xmm0
vmovsd 0x20(%rsp), %xmm1
movq 0x8(%rsp), %rdx
movl 0x18(%rsp), %esi
movq %r12, %rdi
movq %r14, %rcx
callq 0x35736
callq 0xb5a0
vmovsd (%r13), %xmm0
subq %rbx, %rax
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm0, %xmm1
vcvtsi2sd %rax, %xmm2, %xmm1
vdivsd 0x3d88e9(%rip), %xmm1, %xmm1 # 0x459a80
jae 0x810fa
vucomisd %xmm0, %xmm1
jbe 0x810fa
movb $0x1, %al
xchgb %al, 0x3(%rsp)
movq 0xa0(%rsp), %rbx
movq 0xa8(%rsp), %r14
movq 0x10(%rsp), %r12
cmpq %r14, %rbx
je 0x811d5
movq %rbx, %rdi
callq 0xb1a0
addq $0x8, %rbx
jmp 0x811c2
movq 0x80(%rsp), %rbx
movq %r12, %rdi
movq %rbx, %rsi
callq 0x31d28
addq $0xc0, %rbx
leaq 0x20(%r12), %rdi
movq %rbx, %rsi
callq 0x352c2
leaq 0x50(%r12), %rdi
movq 0x88(%rsp), %rsi
callq 0x352ec
movl 0x4(%rsp), %eax
movl %eax, 0x90(%r12)
movq 0x50(%rsp), %rax
subq 0x48(%rsp), %rax
pushq $0x28
popq %rcx
cqto
xorl %esi, %esi
idivq %rcx
movq 0x118(%rsp), %rdi
movq 0x130(%rsp), %rcx
movl %eax, 0x94(%r12)
movslq (%rdi), %rax
imulq $0x38, %rax, %rax
movl 0x30(%rcx,%rax), %edx
leaq (%rcx,%rax), %rbx
testl %edx, %edx
setne %sil
leal (%rsi,%rsi,2), %esi
movl %esi, 0xa0(%r12)
vmovsd 0x18(%rcx,%rax), %xmm0
vmovsd %xmm0, 0x80(%r12)
movq 0x28(%rcx,%rax), %rax
movq %rax, 0x88(%r12)
movl %edx, 0x98(%r12)
movl 0xe8(%r13), %eax
testl %eax, %eax
je 0x81330
cmpl $0x1, %eax
je 0x812f8
cmpl $0x2, %eax
jne 0x8134f
leaq 0x68(%r12), %rbx
pushq $0x5
popq %rsi
movq %rbx, %rdi
callq 0x35292
xorl %r14d, %r14d
xorl %r15d, %r15d
cmpq $0x5, %r15
je 0x8134f
movq 0x118(%rsp), %rax
movq (%rbx), %rsi
movl 0x4(%rsp), %edx
movslq (%rax,%r15,4), %rax
addq %r14, %rsi
imulq $0x38, %rax, %rdi
addq 0x130(%rsp), %rdi
callq 0x4f485
incq %r15
addq $0x20, %r14
jmp 0x812be
leaq 0x68(%r12), %r14
pushq $0x2
popq %rsi
movq %r14, %rdi
callq 0x35292
movl 0x4(%rsp), %edx
movq (%r14), %rsi
movq %rbx, %rdi
callq 0x4f485
leaq 0xe0(%rsp), %rdi
callq 0x88db4
movq (%r14), %rsi
movq %rax, %rbx
addq $0x20, %rsi
jmp 0x81343
leaq 0x68(%r12), %r14
pushq $0x1
popq %rsi
movq %r14, %rdi
callq 0x35292
movq (%r14), %rsi
movl 0x4(%rsp), %edx
movq %rbx, %rdi
callq 0x4f485
leaq 0xd8(%rsp), %rdi
movq %r13, %rsi
callq 0x818e0
cmpq $0x0, 0x168(%r13)
je 0x8137b
addq $0x158, %r13 # imm = 0x158
movq %r13, %rdi
movq %r12, %rsi
callq 0x357ea
leaq 0x30(%rsp), %rdi
callq 0x357fe
leaq 0xd8(%rsp), %rdi
callq 0x818f4
leaq 0xa0(%rsp), %rdi
callq 0x35836
leaq 0x60(%rsp), %rdi
callq 0x88e94
leaq 0xb8(%rsp), %rdi
callq 0x6d8d6
leaq 0x48(%rsp), %rdi
callq 0x35858
movq %r12, %rax
addq $0x198, %rsp # imm = 0x198
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
jmp 0x81417
movq %rax, %rbx
jmp 0x81424
movq %rax, %rbx
jmp 0x81431
jmp 0x813fb
jmp 0x813ec
jmp 0x8140a
jmp 0x8140a
movq %r12, 0x10(%rsp)
movq %rax, %rbx
jmp 0x81452
movq %r12, 0x10(%rsp)
movq %rax, %rbx
jmp 0x81448
jmp 0x8140a
jmp 0x8140a
jmp 0x8140a
jmp 0x8140a
jmp 0x8140a
movq %rax, %rbx
leaq 0x30(%rsp), %rdi
callq 0x357fe
leaq 0xd8(%rsp), %rdi
callq 0x818f4
leaq 0xa0(%rsp), %rdi
callq 0x35836
leaq 0x60(%rsp), %rdi
callq 0x88e94
leaq 0xb8(%rsp), %rdi
callq 0x6d8d6
leaq 0x48(%rsp), %rdi
callq 0x35858
movq 0x10(%rsp), %rdi
callq 0xea60
movq %rbx, %rdi
callq 0xb3d0
| /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_engine rng(init_random_generator_seed(ctx));
auto cost = Cost(pb.objective, variables);
auto cost_constant = pb.objective.value;
switch (ctx.parameters.observer) {
case solver_parameters::observer_type::pnm: {
using obs = pnm_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
} break;
case solver_parameters::observer_type::file: {
using obs = file_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
} break;
default: {
using obs = none_observer;
solver_functor<Solver, Float, Mode, Cost, obs> slv(ctx, rng);
ret = slv(constraints, variables, cost, cost_constant);
break;
}
}
} else {
ret.status = result_status::success;
ret.solutions.resize(1);
ret.solutions.back().value = pb.objective.value;
}
ret.strings = pb.strings;
ret.variable_name = std::move(pb.vars.names);
ret.affected_vars = std::move(pb.affected_vars);
ret.variables = variables;
ret.constraints = length(constraints);
if (ctx.finish)
ctx.finish(ret);
return ret;
} | 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 %zmm0, (%rbx)
movq $0x7fffffff, 0x98(%rbx) # imm = 0x7FFFFFFF
movl $0x2, 0xa0(%rbx)
movq 0xb0(%r15), %rax
subq 0xa8(%r15), %rax
pushq $0xc
popq %rcx
cqto
idivq %rcx
movq %rax, %r12
leaq 0x8(%rsp), %rdi
movq %r14, %rsi
movq %r15, %rdx
vzeroupper
callq 0x450078
movq 0x8(%rsp), %rax
cmpq 0x10(%rsp), %rax
je 0x815bf
movq 0xa8(%r15), %rax
cmpq 0xb0(%r15), %rax
je 0x815bf
movq %r14, %rdi
callq 0x353ba
movl $0x7fffffff, %ecx # imm = 0x7FFFFFFF
xorl %edx, %edx
leaq 0x10(%r15), %rsi
divq %rcx
cmpq $0x1, %rdx
adcq $0x0, %rdx
movq %rdx, (%rsp)
leaq 0x20(%rsp), %rdi
movl %r12d, %edx
callq 0x6d526
vmovsd 0x40(%r15), %xmm0
movl 0xe4(%r14), %eax
vxorps %xmm1, %xmm1, %xmm1
leaq 0x40(%rsp), %rsi
cmpl $0x1, %eax
je 0x815e6
cmpl $0x2, %eax
jne 0x81635
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x98(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x89526
jmp 0x81682
andl $0x0, 0xa0(%rbx)
leaq 0x68(%rbx), %rdi
pushq $0x1
popq %rsi
callq 0x35292
vmovsd 0x40(%r15), %xmm0
movq 0x70(%rbx), %rax
vmovsd %xmm0, -0x8(%rax)
jmp 0x816b1
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x98(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x88ebc
jmp 0x81682
movabsq $0x7ff0000000000000, %r9 # imm = 0x7FF0000000000000
vmovaps %xmm1, (%rsi)
movq %r14, 0x10(%rsi)
movq %rsp, %rax
movq %rax, 0x18(%rsi)
vmovaps %xmm1, 0x20(%rsi)
movq %r9, 0x30(%rsi)
andq $0x0, 0x48(%rsi)
vmovups %xmm1, 0x38(%rsi)
movl $0x7fffffff, 0x50(%rsi) # imm = 0x7FFFFFFF
leaq 0x98(%rsp), %rdi
leaq 0x8(%rsp), %rdx
leaq 0x20(%rsp), %r8
movl %r12d, %ecx
callq 0x89b90
leaq 0x98(%rsp), %r13
movq %rbx, %rdi
movq %r13, %rsi
callq 0x41d9e
movq %r13, %rdi
callq 0xea60
leaq 0x68(%rsp), %rdi
callq 0x357fe
leaq 0x20(%rsp), %rdi
callq 0x6d8d6
leaq 0x90(%r15), %r13
movq %rbx, %rdi
movq %r15, %rsi
callq 0x31d28
leaq 0x50(%rbx), %rdi
movq %r13, %rsi
callq 0x352ec
addq $0xc0, %r15
leaq 0x20(%rbx), %rdi
movq %r15, %rsi
callq 0x352c2
movq 0x10(%rsp), %rax
movl %r12d, 0x90(%rbx)
subq 0x8(%rsp), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
movl %eax, 0x94(%rbx)
cmpq $0x0, 0x168(%r14)
je 0x8171d
addq $0x158, %r14 # imm = 0x158
movq %r14, %rdi
movq %rbx, %rsi
callq 0x357ea
leaq 0x8(%rsp), %rdi
callq 0x35858
movq %rbx, %rax
addq $0x140, %rsp # imm = 0x140
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x8173f
jmp 0x8173f
leaq 0x68(%rsp), %rdi
movq %rax, %r14
callq 0x357fe
leaq 0x20(%rsp), %rdi
callq 0x6d8d6
jmp 0x81762
jmp 0x8175f
movq %rax, %r14
jmp 0x8176c
movq %rax, %r14
leaq 0x8(%rsp), %rdi
callq 0x35858
movq %rbx, %rdi
callq 0xea60
movq %r14, %rdi
callq 0xb3d0
| /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::itm::merged_constraint>> const&) | 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_bastert(variables)
, m_random(variables)
, costs(costs_)
, cost_constant(cost_constant_)
, m_size(population_size)
{
for (auto& elem : m_data)
elem.x = bit_array(variables);
init_with_bastert<Cost, Mode>(m_bastert, costs_, variables, 0);
for (int i = 0, e = m_size / 2; i != e; ++i) {
m_data[i].x = m_bastert;
std::bernoulli_distribution dist(
std::clamp(static_cast<double>(i) / (5 * e), 0.0, 1.0));
for (int v = 0; v != variables; ++v)
if (dist(rng))
m_data[i].x.invert(v);
}
for (int i = m_size / 2, e = m_size; i + 1 < e; i += 2) {
init_with_random(m_data[i].x, rng, variables, 0.2);
init_with_random(m_data[i + 1].x, rng, variables, 0.8);
init_with_pre_solve<Cost, Mode>(
m_data[i].x,
m_data[i + 1].x,
rng,
costs_,
constraints_,
std::clamp(static_cast<double>(i) / (5 * e), 0.0, 1.0));
}
for (int i = 0, e = m_size; i != e; ++i) {
m_data[i].make_hash();
m_data[i].value = costs.results(m_data[i].x, cost_constant_);
m_data[i].remaining_constraints = 0;
for (int k = 0, end_k = length(constraints_); k != end_k; ++k) {
int sum = 0;
for (const auto& elem : constraints_[k].elements) {
if (m_data[i].x[elem.variable_index])
sum += elem.factor;
}
if (!(constraints_[k].min <= sum &&
sum <= constraints_[k].max))
++m_data[i].remaining_constraints;
}
}
std::iota(std::begin(m_indices), std::end(m_indices), 0);
sort();
} | 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 %ymm0, (%rdi)
addq $0x38, %rdi
movq %r12, %rsi
movq %rdi, 0x48(%rsp)
vzeroupper
callq 0x3140c
leaq 0x50(%r15), %r14
leaq 0x58(%rsp), %rdx
movq %r14, %rdi
movq %r12, %rsi
callq 0x4f90a
leaq 0x68(%r15), %rdi
movl %ebp, %esi
movq %rdi, 0x10(%rsp)
callq 0x368ae
leaq 0x78(%r15), %rdi
movl %ebp, %esi
callq 0x368ae
vmovsd 0x40(%rsp), %xmm0
movq 0x18(%rsp), %rax
movq %r15, 0x8(%rsp)
leaq 0x58(%rsp), %r12
movq %rax, 0x88(%r15)
vmovsd %xmm0, 0x90(%r15)
movl %ebx, 0x98(%r15)
movq 0x50(%r15), %rbx
movq 0x58(%r15), %r15
cmpq %r15, %rbx
je 0x819f1
movq %r12, %rdi
movl %ebp, %esi
callq 0x368ae
movq %rbx, %rdi
movq %r12, %rsi
callq 0x3696c
leaq 0x60(%rsp), %rdi
callq 0x357fe
addq $0x38, %rbx
jmp 0x819c7
movq 0x10(%rsp), %rdi
movq 0x18(%rsp), %rsi
xorl %r15d, %r15d
movl %ebp, %edx
xorl %ecx, %ecx
callq 0x81d0f
movq 0x8(%rsp), %rax
movl 0x98(%rax), %eax
pushq $0x2
popq %rcx
cltd
idivl %ecx
movq %rax, 0x20(%rsp)
leal (%rax,%rax,4), %eax
vcvtsi2sd %eax, %xmm1, %xmm0
vmovsd %xmm0, 0x50(%rsp)
cmpq 0x20(%rsp), %r15
je 0x81aa3
movq (%r14), %rdi
imulq $0x38, %r15, %r12
addq %r12, %rdi
movq 0x10(%rsp), %rsi
callq 0x36a44
vcvtsi2sd %r15d, %xmm3, %xmm0
vdivsd 0x50(%rsp), %xmm0, %xmm0
vmovsd 0x3d25e0(%rip), %xmm1 # 0x454038
xorl %ebx, %ebx
vminsd %xmm0, %xmm1, %xmm2
vxorpd %xmm1, %xmm1, %xmm1
vcmpltsd %xmm1, %xmm0, %k1
vmovsd %xmm1, %xmm2, %xmm2 {%k1}
vmovapd %xmm2, 0x30(%rsp)
cmpl %ebx, %ebp
je 0x81a9e
movq %r13, %rdi
callq 0x36ac3
vmovapd 0x30(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x81a9a
movq (%r14), %rdi
movl %ebx, %esi
addq %r12, %rdi
callq 0x3626e
incl %ebx
jmp 0x81a75
incq %r15
jmp 0x81a2a
movq 0x8(%rsp), %rax
movslq 0x98(%rax), %rsi
movl %esi, %eax
cltd
pushq $0x2
popq %rcx
idivl %ecx
leal (%rsi,%rsi,4), %ecx
movq %rsi, 0x30(%rsp)
vcvtsi2sd %ecx, %xmm3, %xmm0
vmovsd %xmm0, 0x10(%rsp)
movslq %eax, %r12
movl %eax, %r15d
imulq $0x38, %r12, %rbx
incq %r12
cmpq 0x30(%rsp), %r12
jge 0x81b69
vmovsd 0x3d7f9f(%rip), %xmm0 # 0x459a88
movq (%r14), %rdi
movq %r13, %rsi
movl %ebp, %edx
addq %rbx, %rdi
callq 0x362ac
vmovsd 0x3d7f8f(%rip), %xmm0 # 0x459a90
movq (%r14), %rax
movq %r13, %rsi
movl %ebp, %edx
leaq 0x38(%rax,%rbx), %rdi
callq 0x362ac
vcvtsi2sd %r15d, %xmm3, %xmm0
vdivsd 0x10(%rsp), %xmm0, %xmm1
vmovsd 0x3d2512(%rip), %xmm0 # 0x454038
movq (%r14), %rdi
movq 0x18(%rsp), %rcx
movq 0x28(%rsp), %r8
vxorpd %xmm2, %xmm2, %xmm2
movq %r13, %rdx
leaq 0x38(%rdi,%rbx), %rsi
addq %rbx, %rdi
vcmpltsd %xmm2, %xmm1, %k1
vminsd %xmm1, %xmm0, %xmm0
vmovsd %xmm2, %xmm0, %xmm0 {%k1}
callq 0x81d84
addl $0x2, %r15d
addq $0x70, %rbx
addq $0x2, %r12
jmp 0x81ad6
movq 0x8(%rsp), %rax
movl 0x98(%rax), %eax
movq %rax, 0x20(%rsp)
xorl %eax, %eax
cmpq 0x20(%rsp), %rax
je 0x81c60
movq 0x8(%rsp), %rbx
imulq $0x38, %rax, %rbp
movq %rax, 0x10(%rsp)
movq 0x50(%rbx), %rdi
addq %rbp, %rdi
callq 0x4fc80
vmovsd 0x40(%rsp), %xmm0
movq 0x50(%rbx), %rsi
movq 0x88(%rbx), %rdi
addq %rbp, %rsi
callq 0x6e096
movq 0x50(%rbx), %rax
vmovsd %xmm0, 0x10(%rax,%rbp)
andl $0x0, 0x30(%rax,%rbp)
movq 0x28(%rsp), %rax
movq (%rax), %rcx
movq 0x8(%rax), %rax
subq %rcx, %rax
cqto
pushq $0x28
popq %rsi
idivq %rsi
movl %eax, %eax
movq %rax, 0x18(%rsp)
xorl %eax, %eax
cmpq 0x18(%rsp), %rax
je 0x81c53
imulq $0x28, %rax, %r12
movq %rax, 0x30(%rsp)
xorl %r15d, %r15d
movq (%rcx,%r12), %r13
movq 0x8(%rcx,%r12), %rbx
cmpq %rbx, %r13
je 0x81c29
movq (%r14), %rdi
movl 0x4(%r13), %esi
addq %rbp, %rdi
callq 0x3664a
testl %eax, %eax
je 0x81c20
movl (%r13), %eax
addl %eax, %r15d
addq $0x8, %r13
jmp 0x81c04
movq 0x28(%rsp), %rax
movq (%rax), %rcx
cmpl %r15d, 0x18(%rcx,%r12)
jg 0x81c42
addq %rcx, %r12
cmpl 0x1c(%r12), %r15d
jle 0x81c49
movq (%r14), %rax
incl 0x30(%rax,%rbp)
movq 0x30(%rsp), %rax
incq %rax
jmp 0x81be8
movq 0x10(%rsp), %rax
incq %rax
jmp 0x81b7b
movq 0x8(%rsp), %rdi
xorl %edx, %edx
movq 0x38(%rdi), %rax
movq 0x40(%rdi), %rcx
cmpq %rcx, %rax
je 0x81c7e
movl %edx, (%rax)
incl %edx
addq $0x4, %rax
jmp 0x81c6f
callq 0x8204a
addq $0x68, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
movq %rax, %rbx
jmp 0x81cb9
movq %rax, %rbx
jmp 0x81cc5
movq %rax, %rbx
jmp 0x81ccd
jmp 0x81ca5
jmp 0x81ca5
movq 0x8(%rsp), %r15
movq %rax, %rbx
leaq 0x80(%r15), %rdi
callq 0x357fe
addq $0x70, %r15
movq %r15, %rdi
callq 0x357fe
movq %r14, %rdi
callq 0x4fd7c
movq 0x48(%rsp), %rdi
callq 0x26a34
movq %rbx, %rdi
callq 0xb3d0
nop
| /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 %cl
sete %al
vucomisd %xmm0, %xmm1
ja 0x81d65
andb %cl, %al
andb %al, %r13b
jne 0x81d65
movq %r15, %rdi
movl %r12d, %esi
callq 0x36a06
jmp 0x81d70
movq %r15, %rdi
movl %r12d, %esi
callq 0x369c8
incl %r12d
jmp 0x81d27
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, double) | 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 = 0;
for (const auto& cst : constraints)
if (length(cst.elements) > max_length)
max_length = length(cst.elements);
struct reduced_cost
{
float value;
int factor;
int id;
};
std::vector<reduced_cost> R(max_length);
std::bernoulli_distribution dist(init_random);
for (const auto& cst : constraints) {
if (!dist(rng))
continue;
R.resize(cst.elements.size());
const int r_size = length(cst.elements);
for (int i = 0; i != r_size; ++i) {
R[i].value = static_cast<float>(c[cst.elements[i].variable_index]);
R[i].factor = cst.elements[i].factor;
R[i].id = cst.elements[i].variable_index;
}
std::shuffle(std::begin(R), std::end(R), rng);
std::sort(
std::begin(R), std::end(R), [](const auto& lhs, const auto& rhs) {
return is_better_solution<Mode>(lhs.value, rhs.value);
});
if (!x_pessimistic.empty()) {
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (cst.min <= sum && sum <= cst.max) {
best = i;
break;
}
if (i + 1 < r_size)
sum += R[i + 1].factor;
}
int i = 0;
for (; i <= best; ++i)
x_pessimistic.set(R[i].id);
for (; i != r_size; ++i) {
x_pessimistic.unset(R[i].id);
}
}
if (!x_optimistic.empty()) {
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (cst.min <= sum && sum <= cst.max)
best = i;
if (best != -2 && i + 1 < r_size &&
stop_iterating<Mode>(R[i + 1].value))
break;
if (i + 1 < r_size)
sum += R[i + 1].factor;
}
int i = 0;
for (; i <= best; ++i)
x_optimistic.set(R[i].id);
for (; i != r_size; ++i)
x_optimistic.unset(R[i].id);
}
}
} | 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
shrq $0x3, %rsi
cmpl %esi, %edx
cmovgl %edx, %esi
addq $0x28, %rax
movl %esi, %edx
jmp 0x81db4
movl %edx, %esi
leaq 0x8(%rsp), %rdi
leaq 0x7(%rsp), %rdx
callq 0x82126
movq (%r13), %rbp
movq 0x8(%r13), %rax
movq %r15, 0x30(%rsp)
movq %r12, 0x28(%rsp)
movq %rax, 0x50(%rsp)
cmpq 0x50(%rsp), %rbp
je 0x82026
movq %r12, %rdi
callq 0x36ac3
vmovsd 0x48(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x8201d
movq 0x8(%rbp), %rsi
subq (%rbp), %rsi
sarq $0x3, %rsi
leaq 0x8(%rsp), %rdi
callq 0x8217a
movq (%rbp), %rax
movq 0x8(%rbp), %rdx
movl $0x2003, %ecx # imm = 0x2003
subq %rax, %rdx
bextrq %rcx, %rdx, %r14
movq %rdx, 0x38(%rsp)
pushq $0x4
popq %rbx
xorl %r13d, %r13d
cmpq %r13, %r14
je 0x81e88
movl 0x4(%rax,%r13,8), %esi
movq %r15, %rdi
callq 0x6e256
movq 0x8(%rsp), %rcx
vcvtsd2ss %xmm0, %xmm0, %xmm0
vmovss %xmm0, -0x4(%rcx,%rbx)
movq (%rbp), %rax
movq (%rax,%r13,8), %rdx
incq %r13
movq %rdx, (%rcx,%rbx)
addq $0xc, %rbx
jmp 0x81e52
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rsi
movq %r12, %rdx
callq 0x821b2
movq 0x8(%rsp), %rdi
movq 0x10(%rsp), %rsi
callq 0x82615
movq 0x20(%rsp), %rax
cmpq $0x0, 0x8(%rax)
je 0x81f53
movq 0x38(%rsp), %rcx
movq 0x8(%rsp), %rax
xorl %esi, %esi
shrq $0x3, %rcx
addq $0x4, %rax
movslq %ecx, %rdx
pushq $-0x1
popq %rcx
imulq $0xc, %rcx, %rdi
addq %rax, %rdi
cmpq %rdx, %rcx
jge 0x81ef9
cmpl %esi, 0x18(%rbp)
jg 0x81ee9
cmpl 0x1c(%rbp), %esi
jle 0x81efc
incq %rcx
addq $0xc, %rdi
cmpq %rdx, %rcx
jge 0x81eda
addl (%rdi), %esi
jmp 0x81ed3
pushq $-0x2
popq %rcx
movslq %ecx, %r15
movq %r14, %r13
pushq $0x8
popq %rbx
xorl %r12d, %r12d
cmpq %r15, %r12
jg 0x81f2b
movq 0x8(%rsp), %rax
movq 0x20(%rsp), %rdi
movl (%rax,%rbx), %esi
callq 0x369c8
incq %r12
addq $0xc, %rbx
decq %r13
jmp 0x81f08
movq 0x30(%rsp), %r15
movq 0x28(%rsp), %r12
subq $0x1, %r13
jb 0x81f53
movq 0x8(%rsp), %rax
movq 0x20(%rsp), %rdi
movl (%rax,%rbx), %esi
callq 0x36a06
addq $0xc, %rbx
jmp 0x81f35
movq 0x40(%rsp), %r13
cmpq $0x0, 0x8(%r13)
je 0x8201d
movq 0x38(%rsp), %rcx
movq 0x8(%rsp), %rax
xorl %edx, %edx
shrq $0x3, %rcx
addq $0xc, %rax
movslq %ecx, %rcx
pushq $-0x1
popq %rsi
pushq $-0x2
popq %rdi
imulq $0xc, %rsi, %r8
addq %rax, %r8
movl %edi, %r9d
cmpq %rcx, %rsi
jge 0x81fcd
cmpl 0x1c(%rbp), %edx
movl %esi, %edi
cmovgl %r9d, %edi
cmpl %edx, 0x18(%rbp)
cmovgl %r9d, %edi
incq %rsi
cmpl $-0x2, %edi
je 0x81fbb
cmpq %rcx, %rsi
jge 0x81fbb
vmovss (%r8), %xmm0
vucomiss 0x3d7aff(%rip), %xmm0 # 0x459ab8
ja 0x81fca
addq $0xc, %r8
cmpq %rcx, %rsi
jge 0x81f87
addl -0x8(%r8), %edx
jmp 0x81f80
movl %edi, %r9d
movslq %r9d, %r15
pushq $0x8
popq %rbx
xorl %r12d, %r12d
cmpq %r15, %r12
jg 0x81ff7
movq 0x8(%rsp), %rax
movq %r13, %rdi
movl (%rax,%rbx), %esi
callq 0x369c8
incq %r12
addq $0xc, %rbx
decq %r14
jmp 0x81fd6
movq 0x30(%rsp), %r15
movq 0x28(%rsp), %r12
subq $0x1, %r14
jb 0x8201d
movq 0x8(%rsp), %rax
movq %r13, %rdi
movl (%rax,%rbx), %esi
callq 0x36a06
addq $0xc, %rbx
jmp 0x82001
addq $0x28, %rbp
jmp 0x81df9
leaq 0x8(%rsp), %rdi
callq 0x823be
addq $0x58, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x82041
movq %rax, %rdi
callq 0xeb9f
nop
| /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;
const double value_1 = this->m_data[i1].value;
const double value_2 = this->m_data[i2].value;
if (cst_1 < cst_2)
return true;
if (cst_1 == cst_2)
return is_better_solution<Mode>(value_1, value_2);
return false;
});
#ifdef BARYONYX_ENABLE_DEBUG
to_log(stdout, 3u, "- Solutions init population:\n");
for (int i = 0; i != m_size; ++i) {
to_log(stdout,
5u,
"- {} id {} value {} constraint {} hash {}\n",
i,
m_indices[i],
m_data[m_indices[i]].value,
m_data[m_indices[i]].remaining_constraints,
m_data[m_indices[i]].hash);
}
#endif
} | 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 # 0x45a098
pushq $0x3
popq %rsi
pushq $0x1d
popq %rdx
callq 0x377fc
leaq 0x3d801a(%rip), %r14 # 0x45a0b6
xorl %eax, %eax
pushq $0x5
popq %rbp
pushq $0x2a
popq %r15
leaq 0x4(%rsp), %r12
movl %eax, 0x4(%rsp)
cmpl 0x98(%rbx), %eax
je 0x82103
movq 0x38(%rbx), %rcx
cltq
movq 0x50(%rbx), %rdx
movq (%r13), %rdi
leaq (%rcx,%rax,4), %r9
movslq (%r9), %rax
imulq $0x38, %rax, %rax
leaq 0x10(%rdx,%rax), %r10
leaq 0x30(%rdx,%rax), %r11
leaq 0x20(%rdx,%rax), %rax
subq $0x8, %rsp
movq %r15, %rdx
movl %ebp, %esi
movq %r14, %rcx
movq %r12, %r8
pushq %rax
pushq %r11
pushq %r10
callq 0x3783f
addq $0x20, %rsp
movl 0x4(%rsp), %eax
incl %eax
jmp 0x820aa
leaq 0x8(%rsp), %rdi
callq 0x378b4
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x8211e
movq %rax, %rdi
callq 0xeb9f
| /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_recorder<baryonyx::itm::quadratic_cost_type<double>, double, baryonyx::itm::minimize_tag>&, std::vector<baryonyx::itm::merged_constraint, std::allocator<baryonyx::itm::merged_constraint>> const&, int, baryonyx::itm::quadratic_cost_type<double> const&, double) | 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_constant)
{
bit_array x(variables);
auto& p = m_ctx.parameters;
auto norm_costs = normalize_costs<Float, Cost>(
m_ctx, original_costs, m_local_ctx.rng, variables);
const auto kappa_step = static_cast<Float>(p.kappa_step);
const auto kappa_max = static_cast<Float>(p.kappa_max);
const auto alpha = static_cast<Float>(p.alpha);
const auto theta = static_cast<Float>(p.theta);
const auto delta =
p.delta < 0
? compute_delta<Float, Cost>(m_ctx, norm_costs, theta, variables)
: static_cast<Float>(p.delta);
const auto pushing_k_factor = static_cast<Float>(p.pushing_k_factor);
const auto pushing_objective_amplifier =
static_cast<Float>(p.pushing_objective_amplifier);
const auto w_limit = static_cast<long int>(p.w);
Solver slv(m_local_ctx.rng,
length(constraints),
variables,
norm_costs,
constraints);
compute_order compute(p.order, variables);
bool is_a_solution = false;
while (!stop_task.load()) {
++m_call_number;
const auto kappa_start = static_cast<Float>(best_recorder.reinit(
m_local_ctx, is_a_solution, p.kappa_min, p.kappa_max, x));
auto kappa = kappa_start;
compute.init(slv, x);
auto best_remaining = INT_MAX;
is_a_solution = false;
for (long int i = 0; !stop_task.load() && i != p.limit; ++i) {
auto remaining =
compute.run(slv, x, m_local_ctx.rng, kappa, delta, theta);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
i);
best_remaining = 0;
is_a_solution = true;
break;
} else {
best_remaining = std::min(remaining, best_remaining);
}
if (i > w_limit)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
}
if (best_remaining > 0) {
best_recorder.try_advance(
m_local_ctx, x, best_remaining, p.limit);
continue;
}
for (int push = 0; !stop_task.load() && push < p.pushes_limit;
++push) {
auto remaining =
compute.push_and_run(slv,
x,
m_local_ctx.rng,
pushing_k_factor,
delta,
theta,
pushing_objective_amplifier);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - 1);
is_a_solution = true;
}
kappa = kappa_start;
for (int iter = 0;
!stop_task.load() && iter < p.pushing_iteration_limit;
++iter) {
remaining = compute.run(
slv, x, m_local_ctx.rng, kappa, delta, theta);
if (remaining == 0) {
best_recorder.try_update(
m_local_ctx,
x,
original_costs.results(x, cost_constant),
-push * p.pushing_iteration_limit - iter - 1);
is_a_solution = true;
break;
}
if (iter > p.w)
kappa +=
kappa_step * std::pow(static_cast<Float>(remaining) /
static_cast<Float>(slv.m),
alpha);
if (kappa > kappa_max)
break;
}
}
}
} | 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(%rsp)
addq $0x8, %rbp
leaq 0x98(%rsp), %rdi
movq %r13, %rsi
movq %r12, 0x48(%rsp)
movq %r12, %rdx
movq %rbp, %rcx
movl %ebx, %r8d
callq 0x6fb57
vmovsd 0x20(%r13), %xmm0
vmovsd 0x10(%r13), %xmm1
vmovsd %xmm0, 0x70(%rsp)
vmovsd 0x28(%r13), %xmm0
vmovsd %xmm1, 0x38(%rsp)
vmovsd %xmm0, 0x78(%rsp)
vmovsd 0x30(%r13), %xmm0
vmovsd %xmm0, 0x68(%rsp)
vmovsd 0x8(%r13), %xmm0
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
vucomisd %xmm1, %xmm0
jbe 0x835ca
movq 0x58(%rsp), %rax
movq (%rax), %rdi
vmovsd 0x40(%rsp), %xmm0
leaq 0x98(%rsp), %rsi
movl %ebx, %edx
callq 0x6fc31
vmovsd %xmm0, 0x38(%rsp)
vcvttsd2si 0xa0(%r13), %rax
vmovsd 0x38(%r13), %xmm0
vmovsd 0x40(%r13), %xmm1
movq %rax, 0x80(%rsp)
movq 0x8(%r14), %rax
vmovsd %xmm0, 0x90(%rsp)
vmovsd %xmm1, 0x88(%rsp)
subq (%r14), %rax
pushq $0x28
popq %rcx
cqto
idivq %rcx
leaq 0xf0(%rsp), %rdi
leaq 0x98(%rsp), %r8
movq %rbp, %rsi
movl %eax, %edx
movl %ebx, %ecx
movq %r14, %r9
callq 0x839f2
movl 0xcc(%r13), %esi
leaq 0xb8(%rsp), %rdi
movl %ebx, %edx
callq 0x38cd8
movq $0x0, 0x8(%rsp)
movb (%r15), %al
testb $0x1, %al
jne 0x83959
movq 0x58(%rsp), %rax
incq 0xb0(%rax)
vmovsd 0x18(%r13), %xmm0
vmovsd 0x28(%r13), %xmm1
movzbl 0x8(%rsp), %edx
movq 0x20(%rsp), %rdi
leaq 0x10(%rsp), %rbx
movq %rbp, %rsi
movq %rbx, %rcx
andl $0x1, %edx
callq 0x83c1a
vmovsd %xmm0, 0x60(%rsp)
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
movq %rbx, %rdx
callq 0x83d1a
vmovsd 0x60(%rsp), %xmm0
movl $0x7fffffff, %ebx # imm = 0x7FFFFFFF
xorl %r14d, %r14d
movb (%r15), %al
testb $0x1, %al
jne 0x83751
cmpq 0xb0(%r13), %r14
je 0x83751
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
leaq 0x10(%rsp), %rdx
movq %rbp, %rcx
vmovsd %xmm0, 0x28(%rsp)
callq 0x83d5c
testl %eax, %eax
je 0x83769
cmpl %eax, %ebx
cmovgel %eax, %ebx
cmpq 0x80(%rsp), %r14
jle 0x8373b
vcvtsi2sd %eax, %xmm3, %xmm0
vcvtsi2sdl 0x170(%rsp), %xmm3, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x68(%rsp), %xmm1
callq 0xb1f0
vmovsd 0x28(%rsp), %xmm1
vfmadd231sd 0x70(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x83741
vmovsd 0x28(%rsp), %xmm0
vucomisd 0x78(%rsp), %xmm0
ja 0x83751
incq %r14
jmp 0x836b2
testl %ebx, %ebx
jg 0x83939
leaq 0x10(%rsp), %rbx
movq $0x0, 0x8(%rsp)
jmp 0x8379b
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
leaq 0x10(%rsp), %rbx
movq %rbx, %rsi
callq 0x6e096
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %rbx, %rdx
movq %r14, %rcx
callq 0x83f68
movb $0x1, %al
movq %rax, 0x8(%rsp)
xorl %r14d, %r14d
movl $0x0, 0x34(%rsp)
movb (%r15), %al
testb $0x1, %al
jne 0x83646
cmpl 0xbc(%r13), %r14d
jge 0x83646
vmovsd 0x90(%rsp), %xmm0
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
vmovsd 0x88(%rsp), %xmm3
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
movq %rbx, %rdx
movq %rbp, %rcx
callq 0x84072
testl %eax, %eax
jne 0x83835
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
movq %rbx, %rsi
callq 0x6e096
movl 0xc0(%r13), %eax
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %rbx, %rdx
imull %r14d, %eax
notl %eax
movslq %eax, %rcx
callq 0x83f68
movb $0x1, %al
movq %rax, 0x8(%rsp)
pushq $0x1
popq %rax
vmovsd 0x60(%rsp), %xmm0
movl %eax, %ebx
movb (%r15), %al
testb $0x1, %al
jne 0x838e3
leal -0x1(%rbx), %r12d
cmpl 0xc0(%r13), %r12d
jge 0x838e3
vmovsd 0x38(%rsp), %xmm1
vmovsd 0x40(%rsp), %xmm2
leaq 0xb8(%rsp), %rdi
leaq 0xf0(%rsp), %rsi
leaq 0x10(%rsp), %rdx
movq %rbp, %rcx
vmovsd %xmm0, 0x28(%rsp)
callq 0x83d5c
testl %eax, %eax
je 0x838ea
vcvtsi2sd %r12d, %xmm4, %xmm0
vucomisd 0xa0(%r13), %xmm0
jbe 0x838ce
vcvtsi2sd %eax, %xmm4, %xmm0
vcvtsi2sdl 0x170(%rsp), %xmm4, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd 0x68(%rsp), %xmm1
callq 0xb1f0
vmovsd 0x28(%rsp), %xmm1
vfmadd231sd 0x70(%rsp), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
vmovapd %xmm1, %xmm0
jmp 0x838d4
vmovsd 0x28(%rsp), %xmm0
vucomisd 0x78(%rsp), %xmm0
ja 0x838e3
incl %ebx
jmp 0x83840
leaq 0x10(%rsp), %rbx
jmp 0x8392d
vmovsd 0x50(%rsp), %xmm0
movq 0x48(%rsp), %rdi
leaq 0x10(%rsp), %r12
movq %r12, %rsi
callq 0x6e096
movl 0xc0(%r13), %eax
movq 0x20(%rsp), %rdi
movq %rbp, %rsi
movq %r12, %rdx
imull 0x34(%rsp), %eax
subl %ebx, %eax
movq %r12, %rbx
movslq %eax, %rcx
callq 0x83f68
movb $0x1, %al
movq %rax, 0x8(%rsp)
decl 0x34(%rsp)
incl %r14d
jmp 0x837a6
movq 0xb0(%r13), %r8
movq 0x20(%rsp), %rdi
leaq 0x10(%rsp), %rdx
movq %rbp, %rsi
movl %ebx, %ecx
callq 0x83ff0
jmp 0x8363d
leaq 0xb8(%rsp), %rdi
callq 0x393ac
leaq 0xf0(%rsp), %rdi
callq 0x84294
leaq 0x98(%rsp), %rdi
callq 0x6d8d6
leaq 0x18(%rsp), %rdi
callq 0x357fe
addq $0x178, %rsp # imm = 0x178
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x839a3
movq %rax, %rbx
jmp 0x839c5
movq %rax, %rbx
jmp 0x839d2
movq %rax, %rbx
jmp 0x839df
jmp 0x839b5
jmp 0x839b5
jmp 0x839b5
jmp 0x839b5
leaq 0xb8(%rsp), %rdi
movq %rax, %rbx
callq 0x393ac
leaq 0xf0(%rsp), %rdi
callq 0x84294
leaq 0x98(%rsp), %rdi
callq 0x6d8d6
leaq 0x18(%rsp), %rdi
callq 0x357fe
movq %rbx, %rdi
callq 0xb3d0
nop
| /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<baryonyx::itm::merged_constraint, std::allocator<baryonyx::itm::merged_constraint>> 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_vector_size(csts)))
, b(std::make_unique<bound_factor[]>(m_))
, pi(std::make_unique<Float[]>(m_))
, P(std::make_unique<Float[]>(ap.size()))
, c(c_)
, dist(0.5)
, m(m_)
, n(n_)
{
int id = 0;
for (int i = 0, e = length(csts); i != e; ++i) {
int lower = 0, upper = 0;
for (const auto& cst : csts[i].elements) {
bx_ensures(std::abs(cst.factor) == 1);
A[id++] = cst.factor;
if (cst.factor > 0)
upper++;
else
lower++;
}
if (csts[i].min == csts[i].max) {
b[i].min = csts[i].min;
b[i].max = csts[i].max;
} else {
b[i].min = std::max(-lower, csts[i].min);
b[i].max = std::min(upper, csts[i].max);
}
bx_ensures(b[i].min <= b[i].max);
}
} | 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
movq %r13, 0x18(%rsp)
callq 0x28eb6
movq %r12, %rdi
leaq 0x50(%r15), %rbp
callq 0x3a89d
movq %rbp, 0x10(%rsp)
movq %rbp, %rdi
movq %rax, %rsi
callq 0x842d2
movslq %r14d, %rbp
leaq 0x58(%r15), %rdi
movq %rbp, %rsi
movq %rdi, 0x8(%rsp)
callq 0x84312
leaq 0x60(%r15), %r13
movq %r13, %rdi
movq %rbp, %rsi
callq 0x2900a
movl 0x30(%r15), %esi
leaq 0x68(%r15), %rdi
callq 0x2900a
movq 0x20(%rsp), %rax
movq %rax, 0x70(%r15)
movabsq $0x3fe0000000000000, %rax # imm = 0x3FE0000000000000
movq %rax, 0x78(%r15)
movl 0x4(%rsp), %eax
movl %r14d, 0x80(%r15)
movl %eax, 0x84(%r15)
movq (%r12), %rcx
movq 0x8(%r12), %rax
subq %rcx, %rax
pushq $0x28
popq %rsi
cqto
xorl %edi, %edi
idivq %rsi
movq 0x58(%r15), %rdx
xorl %esi, %esi
movl %eax, %eax
cmpq %rax, %rsi
je 0x83b9c
imulq $0x28, %rsi, %r8
movq (%rbx), %r15
movslq %edi, %rdi
xorl %r10d, %r10d
movq (%rcx,%r8), %r11
movq 0x8(%rcx,%r8), %r14
leaq (%rcx,%r8), %r9
xorl %r8d, %r8d
cmpq %r14, %r11
je 0x83b2f
movl (%r11), %r12d
leal 0x1(%r12), %ebp
testl $0xfffffffd, %ebp # imm = 0xFFFFFFFD
jne 0x83bab
movl %r12d, (%r15,%rdi,4)
incq %rdi
xorl %ebp, %ebp
xorl %r12d, %r12d
cmpl $0x0, (%r11)
setle %bpl
setg %r12b
addq $0x8, %r11
addl %r12d, %r10d
addl %ebp, %r8d
jmp 0x83af2
movl 0x18(%r9), %r11d
cmpl 0x1c(%r9), %r11d
jne 0x83b46
imulq $0xc, %rsi, %r8
movl %r11d, (%rdx,%r8)
movl %r11d, %r8d
jmp 0x83b66
negl %r8d
cmpl %r8d, %r11d
cmovgl %r11d, %r8d
imulq $0xc, %rsi, %r11
movl %r8d, (%rdx,%r11)
movl 0x1c(%r9), %r9d
cmpl %r10d, %r9d
cmovll %r9d, %r10d
movl %r10d, %r11d
imulq $0xc, %rsi, %r9
incq %rsi
movl %r11d, 0x4(%rdx,%r9)
cmpl %r11d, %r8d
jle 0x83acc
leaq 0x3d48a8(%rip), %rdi # 0x45842a
leaq 0x3d6720(%rip), %rsi # 0x45a2a9
leaq 0x3d66b7(%rip), %rdx # 0x45a247
leaq 0x3d6727(%rip), %rcx # 0x45a2be
callq 0x2813f
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3d4878(%rip), %rdi # 0x45842a
leaq 0x3d6674(%rip), %rsi # 0x45a22d
leaq 0x3d6687(%rip), %rdx # 0x45a247
leaq 0x3d66df(%rip), %rcx # 0x45a2a6
callq 0x2813f
movq %r13, %rdi
movq %rax, %r14
callq 0x29066
jmp 0x83bdc
movq %rax, %r14
movq 0x8(%rsp), %rdi
callq 0x84350
jmp 0x83beb
movq %rax, %r14
movq 0x10(%rsp), %rdi
callq 0x8436a
jmp 0x83bfa
movq %rax, %r14
movq %rbx, %rdi
callq 0x28fb6
jmp 0x83c07
movq %rax, %r14
movq 0x18(%rsp), %rdi
callq 0x3a954
movq %r14, %rdi
callq 0xb3d0
nop
| /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;
if (m_kappa_append[ctx.thread_id] < ctx.init_kappa_improve_stop) {
m_kappa_append[ctx.thread_id] += ctx.init_kappa_improve_increase;
kappa = kappa_min +
(kappa_max - kappa_min) * m_kappa_append[ctx.thread_id];
to_log(stdout, 5u, "- improve with kappa {}\n", kappa);
} else {
m_kappa_append[ctx.thread_id] = ctx.init_kappa_improve_start;
crossover(ctx, x);
to_log(stdout, 5u, "- crossover\n");
}
mutation(ctx, x);
return kappa;
} | 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
callq 0x3be57
vmovsd 0x10(%rsp), %xmm2
vmovsd %xmm2, (%rsp)
movl 0xa0(%r14), %eax
movq 0xa8(%r15), %rcx
vmovsd 0x98(%r14), %xmm1
vmovsd (%rcx,%rax,8), %xmm0
vucomisd %xmm0, %xmm1
jbe 0x83cc8
vaddsd 0x90(%r14), %xmm0, %xmm0
vmovsd 0x8(%rsp), %xmm1
movq %rsp, %r8
vsubsd %xmm2, %xmm1, %xmm1
vmovsd %xmm0, (%rcx,%rax,8)
leaq 0x3d66cf(%rip), %rcx # 0x45a37c
vfmadd213sd %xmm2, %xmm0, %xmm1 # xmm1 = (xmm0 * xmm1) + xmm2
movq (%r12), %rdi
vmovsd %xmm1, (%r8)
pushq $0x5
popq %rsi
pushq $0x18
popq %rdx
callq 0x3bea4
jmp 0x83cfb
vmovsd 0x88(%r14), %xmm0
leaq 0x8(%r15), %rdi
movq %r14, %rsi
movq %rbx, %rdx
vmovsd %xmm0, (%rcx,%rax,8)
callq 0x844fa
movq (%r12), %rdi
leaq 0x3d66a5(%rip), %rcx # 0x45a395
pushq $0x5
popq %rsi
pushq $0xc
popq %rdx
callq 0x377fc
movq %r15, %rdi
movq %r14, %rsi
movq %rbx, %rdx
callq 0x843a0
vmovsd (%rsp), %xmm0
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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<double>> const&, baryonyx::bit_array const&) | 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_parameters::constraint_order::pi_sign_change:
std::iota(R.begin(), R.end(), 0);
break;
case solver_parameters::constraint_order::none:
case solver_parameters::constraint_order::reversing:
case solver_parameters::constraint_order::random_sorting:
case solver_parameters::constraint_order::lagrangian_decr:
case solver_parameters::constraint_order::lagrangian_incr:
default:
compute_violated_constraints(s, x, R);
break;
}
} | 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 %rax, %rdx
jmp 0x848f6
retq
| /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_type<double>>&, baryonyx::bit_array&, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, double, double, double) | 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:
solver.compute_update_row(
x, R.crbegin(), R.crend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::random_sorting:
std::shuffle(R.begin(), R.end(), rng);
solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::infeasibility_decr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return rhs.second < lhs.second;
});
solver.compute_update_row(
x, m_order.cbegin(), m_order.cend(), kappa, delta, theta);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::infeasibility_incr:
std::sort(m_order.begin(),
m_order.end(),
[](const auto& lhs, const auto& rhs) {
return lhs.second < rhs.second;
});
solver.compute_update_row(
x, m_order.cbegin(), m_order.cend(), kappa, delta, theta);
return infeasibility_local_compute_violated_constraints(solver, x);
case solver_parameters::constraint_order::lagrangian_decr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[rhs] < solver.pi[lhs];
});
solver.compute_update_row(
x, R.cbegin(), R.cend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::lagrangian_incr:
std::sort(
R.begin(), R.end(), [&solver](const auto lhs, const auto rhs) {
return solver.pi[lhs] < solver.pi[rhs];
});
solver.compute_update_row(
x, R.cbegin(), R.cend(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
case solver_parameters::constraint_order::pi_sign_change:
std::shuffle(R.begin(), R.end(), rng);
pi_changed = solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
remaining = local_compute_violated_constraints(solver, x);
if (!pi_changed && remaining == 0)
return 0;
return remaining;
case solver_parameters::constraint_order::none:
default:
solver.compute_update_row(
x, R.begin(), R.end(), kappa, delta, theta);
return compute_violated_constraints(solver, x, R);
}
} | 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 %r15, %rdi
movq %rbx, %rsi
movq %rax, (%rdx)
movq (%r14), %rax
movq %rax, (%rcx)
callq 0x849ec
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
callq 0x848f6
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
retq
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x86d01
jmp 0x83ed0
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x8642b
jmp 0x83e2c
movq 0x18(%r14), %rdi
movq 0x20(%r14), %rsi
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x86896
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq 0x18(%r14), %rdx
movq 0x20(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x852d6
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x85746
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x84e66
jmp 0x83ef4
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %r15, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x871f3
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x85848
movq %r15, %rdi
movq %rbx, %rsi
movq %r14, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x848f6
movq (%r14), %rdi
movq 0x8(%r14), %rsi
movq %rcx, %rdx
vmovsd %xmm2, 0x18(%rsp)
vmovsd %xmm1, 0x10(%rsp)
vmovsd %xmm0, 0x8(%rsp)
callq 0x3ceed
vmovsd 0x8(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
vmovsd 0x18(%rsp), %xmm2
movq (%r14), %rdx
movq 0x8(%r14), %rcx
movq %r15, %rdi
movq %rbx, %rsi
callq 0x84e66
movq %r14, %rdi
movq %r15, %rsi
movq %rbx, %rdx
addq $0x30, %rsp
popq %rbx
popq %r14
popq %r15
jmp 0x85cb8
nop
| /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::steady_clock::now();
const auto duration = compute_duration(m_start, end);
m_storage.insert(ctx, solution, hash, value, duration, loop);
}
} | 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
callq 0x876ea
testb %al, %al
je 0x83fe1
callq 0xb5a0
subq (%r13), %rax
movq %rbp, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %rcx
movq %rbx, %r8
vcvtsi2sd %rax, %xmm1, %xmm0
vdivsd 0x3d5aaa(%rip), %xmm0, %xmm1 # 0x459a80
vmovsd 0x10(%rsp), %xmm0
callq 0x8776a
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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)) {
const auto end = std::chrono::steady_clock::now();
const auto duration = compute_duration(m_start, end);
m_storage.insert(
ctx, solution, hash, remaining_constraints, duration, loop);
}
} | 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
testb %al, %al
je 0x84062
callq 0xb5a0
subq (%r13), %rax
movq 0x10(%rsp), %r9
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %rcx
movl %ebp, %r8d
vcvtsi2sd %rax, %xmm0, %xmm0
vdivsd 0x3d5a23(%rip), %xmm0, %xmm0 # 0x459a80
callq 0x87954
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
nop
| /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_p = ctx.value_p_dist(ctx.rng);
while (val_p < 0.0 || val_p > 1.0);
to_log(stdout,
7u,
"- mutation variables {}% with "
" {}% of set\n",
var_p,
val_p);
std::bernoulli_distribution dist_var_p(var_p);
std::bernoulli_distribution dist_value_p(val_p);
for (int i = 0, e = x.size(); i != e; ++i) {
if (dist_var_p(ctx.rng)) {
to_log(stdout, 9u, "- mutate variable {}\n", i);
x.set(i, dist_value_p(ctx.rng));
}
}
} | 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
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x48(%r14), %r15
leaq 0x28(%r14), %r12
movq %r12, %rdi
movq %r14, %rsi
callq 0x3c480
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm0, %xmm1
jae 0x843ea
vucomisd 0x3cfc31(%rip), %xmm0 # 0x454038
jae 0x843ea
vmovsd %xmm0, 0x18(%rsp)
movq %r15, %rdi
movq %r14, %rsi
callq 0x3c480
vxorpd %xmm1, %xmm1, %xmm1
vucomisd %xmm0, %xmm1
ja 0x8440f
vucomisd 0x3cfc0c(%rip), %xmm0 # 0x454038
ja 0x8440f
movq 0x5b8b93(%rip), %rax # 0x63cfc8
leaq 0x20(%rsp), %r15
leaq 0x3d5fdb(%rip), %rcx # 0x45a41c
vmovsd %xmm0, (%r15)
movq (%rax), %rdi
pushq $0x7
popq %rsi
pushq $0x2a
popq %rdx
leaq 0x18(%rsp), %r12
movq %r15, %r9
movq %r12, %r8
callq 0x3c5d8
vmovsd (%r12), %xmm0
vmovsd (%r15), %xmm1
leaq 0x4(%rsp), %rax
andl $0x0, (%rax)
xorl %eax, %eax
movl (%rbx), %r15d
vmovsd %xmm0, 0x10(%rsp)
vmovsd %xmm1, 0x8(%rsp)
pushq $0x9
popq %rbp
pushq $0x15
popq %r13
cmpl %r15d, %eax
je 0x843d3
movq %r14, %rdi
callq 0x36ac3
vmovsd 0x10(%rsp), %xmm1
vucomisd %xmm0, %xmm1
jbe 0x844ee
movq 0x5b8b1a(%rip), %rax # 0x63cfc8
leaq 0x3d5f92(%rip), %rcx # 0x45a447
leaq 0x4(%rsp), %r8
movl %ebp, %esi
movq %r13, %rdx
movq (%rax), %rdi
callq 0x3c631
movl 0x4(%rsp), %r12d
movq %r14, %rdi
callq 0x36ac3
vmovsd 0x8(%rsp), %xmm1
xorl %edx, %edx
movq %rbx, %rdi
movl %r12d, %esi
vucomisd %xmm0, %xmm1
seta %dl
callq 0x3c67e
movl 0x4(%rsp), %eax
incl %eax
movl %eax, 0x4(%rsp)
jmp 0x8448a
| /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(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_bastert);
to_log(stdout,
7u,
"- crossover between {} ({}) and bastert\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_bastert;
}
} else {
init_with_random(m_random, ctx.rng, x.size(), 0.5);
if (b(ctx.rng)) {
crossover(ctx, x, m_data[first].x, m_random);
to_log(stdout,
7u,
"- crossover between {} ({}) and random\n",
first,
m_data[first].value);
} else {
m_data[first].x = m_random;
}
}
} else {
int first = m_indices[choose_a_solution(ctx)];
int second = m_indices[choose_a_solution(ctx)];
while (first == second)
second = m_indices[choose_a_solution(ctx)];
crossover(ctx, x, m_data[first].x, m_data[second].x);
to_log(stdout,
7u,
"- crossover between {} ({}) and {} ({})\n",
first,
m_data[first].value,
second,
m_data[second].value);
}
} | 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), %rcx
cltq
movl (%rcx,%rax,4), %eax
movl %eax, 0x8(%rsp)
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3d441e(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x84653
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3d4404(%rip), %xmm1 # 0x458978
vucomisd %xmm0, %xmm1
jbe 0x846d7
movslq 0x8(%rsp), %rax
leaq 0x68(%rbx), %r8
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x84772
addq $0x50, %rbx
leaq 0x3d5dfa(%rip), %rcx # 0x45a3a2
pushq $0x28
jmp 0x846ae
movq %rbx, %rdi
movq %r15, %rsi
callq 0x8472e
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %r12
movl %r12d, 0x8(%rsp)
movq %rbx, %rdi
movq %r15, %rsi
callq 0x8472e
movq 0x38(%rbx), %rcx
cltq
movslq (%rcx,%rax,4), %rax
movl %eax, 0xc(%rsp)
cmpl %eax, %r12d
jne 0x845f4
movq %rbx, %rdi
movq %r15, %rsi
callq 0x8472e
jmp 0x845d4
movq 0x50(%rbx), %r8
imulq $0x38, %r12, %r12
imulq $0x38, %rax, %r13
leaq (%r8,%r12), %rcx
addq %r13, %r8
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
callq 0x84772
movq 0x5b89ac(%rip), %rax # 0x63cfc8
movq 0x50(%rbx), %rdx
movq (%rax), %rdi
leaq 0x10(%rdx,%r13), %rax
leaq 0x10(%rdx,%r12), %r9
leaq 0xc(%rsp), %r10
leaq 0x3d5dba(%rip), %rcx # 0x45a3f3
pushq $0x7
popq %rsi
pushq $0x28
popq %rdx
leaq 0x8(%rsp), %r8
pushq %rax
pushq %r10
callq 0x3c3e1
popq %rax
popq %rcx
jmp 0x846f6
movl (%r14), %edx
leaq 0x78(%rbx), %r12
vmovsd 0x3d4316(%rip), %xmm0 # 0x458978
movq %r12, %rdi
movq %r15, %rsi
callq 0x362ac
movq %r15, %rdi
callq 0x36ac3
vmovsd 0x3d42fb(%rip), %xmm1 # 0x458978
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
vucomisd %xmm0, %xmm1
jbe 0x846eb
movq %rbx, %rdi
movq %r15, %rsi
movq %r14, %rdx
movq %r12, %r8
callq 0x84772
addq $0x50, %rbx
leaq 0x3d5d1f(%rip), %rcx # 0x45a3cb
pushq $0x27
popq %rdx
movq 0x5b8912(%rip), %rax # 0x63cfc8
leaq 0x8(%rsp), %r8
movq (%rbx), %rsi
movslq (%r8), %r9
movq (%rax), %rdi
imulq $0x38, %r9, %rax
leaq 0x10(%rsi,%rax), %r9
pushq $0x7
popq %rsi
callq 0x3c388
jmp 0x846f6
movslq 0x8(%rsp), %rax
imulq $0x38, %rax, %rcx
addq 0x50(%rbx), %rcx
addq $0x68, %rbx
movq %rbx, %r12
movq %rcx, %rdi
movq %r12, %rsi
callq 0x36a44
leaq 0x10(%rsp), %rdi
callq 0x3c450
addq $0x20, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
retq
jmp 0x84718
jmp 0x84718
jmp 0x84718
jmp 0x84718
jmp 0x84718
movq %rax, %rbx
leaq 0x10(%rsp), %rdi
callq 0x3c450
movq %rbx, %rdi
callq 0xb3d0
nop
| /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 auto x2 = second.block(i);
x.set_block(i, ((x1 ^ x2) & ctx.crossover_dist(ctx.rng)) ^ x1);
}
} | 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
movl %ebp, %esi
movq %rax, %rbx
callq 0x377b0
movq %rax, %r14
movq %r13, %rdi
movq %r12, %rsi
callq 0x3709a
andnq %rbx, %rax, %rcx
andq %rax, %r14
orq %rcx, %r14
movq (%rsp), %rcx
movq 0x8(%rcx), %rax
movq %r14, (%rax,%rbp,8)
incq %rbp
jmp 0x8479b
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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::minimize_tag, baryonyx::itm::quadratic_cost_type<double>> const&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x848db
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3c868
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x8488f
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x84867
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x848b0
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x848c1
subl 0x4(%rcx,%rdx), %ebx
jle 0x848ce
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x8483c
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_type<double>> const&, baryonyx::bit_array const&, std::vector<int, std::allocator<int>>&) | 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, %al
jne 0x84942
movq %rbx, %rdi
movq %r12, %rsi
callq 0x31460
movl 0x4(%rsp), %esi
incl %esi
jmp 0x8491b
movq 0x8(%rbx), %rax
subq (%rbx), %rax
shrq $0x2, %rax
addq $0x8, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
| /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<double>> const&, int, baryonyx::bit_array const&) | 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), %rax
movq 0x48(%rbx), %rcx
movl 0x4(%r13), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r13
addl %eax, %r15d
jmp 0x84996
movslq 0x4(%rsp), %rcx
movq 0x58(%rbx), %rax
imulq $0xc, %rcx, %rcx
cmpl %r15d, (%rax,%rcx)
jle 0x849d5
xorl %eax, %eax
jmp 0x849dd
cmpl 0x4(%rax,%rcx), %r15d
setle %al
addq $0x18, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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 %rsi, 0x8(%rsp)
movq %r15, 0x50(%rsp)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
movq 0x68(%rsp), %rcx
cmpq (%rcx), %rax
je 0x84e10
movslq -0x4(%rax), %rdx
cmpl 0x80(%r12), %edx
jge 0x84e24
leaq 0x28(%rsp), %rdi
movq %rdx, 0x40(%rsp)
movq %r15, %rsi
callq 0x3de66
vmovsd 0x60(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x85cfa
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x84b43
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x84aee
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x84acd
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x84a97
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x85d17
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x84c46
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3d3d8f(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x84c2f
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x84b9c
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x84c4e
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x84c5a
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x84c53
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x84d6e
testb $0x1, %al
je 0x84d6e
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x84ca5
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x84d15
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x84d15
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x84d15
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3d3c8e(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x84d5d
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3d3c48(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x84c6c
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x84de3
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3d3bd1(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x84d73
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x84961
testb %al, %al
je 0x84e45
movq 0x58(%rsp), %rcx
movq 0x50(%rsp), %r15
movq (%rcx), %rax
addq $-0x4, %rax
movq %rax, (%rcx)
jmp 0x84a45
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3d33b3(%rip), %rdi # 0x4581de
leaq 0x3d5648(%rip), %rsi # 0x45a47a
leaq 0x3d540e(%rip), %rdx # 0x45a247
leaq 0x3d5640(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3d3392(%rip), %rdi # 0x4581de
leaq 0x3d5631(%rip), %rsi # 0x45a484
leaq 0x3d53ed(%rip), %rdx # 0x45a247
leaq 0x3d5644(%rip), %rcx # 0x45a4a5
callq 0x2813f
| /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::vector<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x8527f
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x85293
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x85cfa
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x84fb8
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x84f63
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x84f42
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x84f0c
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x85d17
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x850bb
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3d391a(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x850a4
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x85011
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x850c3
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x850cf
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x850c8
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x851e3
testb $0x1, %al
je 0x851e3
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x8511a
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x8518a
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x8518a
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x8518a
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3d3819(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x851d2
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3d37d3(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x850e1
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x85258
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3d375c(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x851e8
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x84961
testb %al, %al
je 0x852b4
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x4, %rdx
jmp 0x84eb7
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3d2f44(%rip), %rdi # 0x4581de
leaq 0x3d51d9(%rip), %rsi # 0x45a47a
leaq 0x3d4f9f(%rip), %rdx # 0x45a247
leaq 0x3d51d1(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3d2f23(%rip), %rdi # 0x4581de
leaq 0x3d51c2(%rip), %rsi # 0x45a484
leaq 0x3d4f7e(%rip), %rdx # 0x45a247
leaq 0x3d51d5(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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_array&, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x856ef
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x85703
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x85cfa
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x85428
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x853d3
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x853b2
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x8537c
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x85d17
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x8552b
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3d34aa(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x85514
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x85481
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x85533
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x8553f
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x85538
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x85653
testb $0x1, %al
je 0x85653
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x8558a
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x855fa
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x855fa
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x855fa
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3d33a9(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x85642
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3d3363(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x85551
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x856c8
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3d32ec(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x85658
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x84961
testb %al, %al
je 0x85724
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x8, %rdx
jmp 0x85327
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3d2ad4(%rip), %rdi # 0x4581de
leaq 0x3d4d69(%rip), %rsi # 0x45a47a
leaq 0x3d4b2f(%rip), %rdx # 0x45a247
leaq 0x3d4d61(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3d2ab3(%rip), %rdi # 0x4581de
leaq 0x3d4d52(%rip), %rsi # 0x45a484
leaq 0x3d4b0e(%rip), %rdx # 0x45a247
leaq 0x3d4d65(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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_tag, baryonyx::itm::quadratic_cost_type<double>>&, baryonyx::bit_array const&) | 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) = solver.ap.row(k);
int v = 0;
for (; it != et; ++it)
v += solver.factor(it->value) * x[it->column];
if (solver.bound_min(k) > v)
m_order.push_back(std::make_pair(k, solver.bound_min(k) - v));
else if (solver.bound_max(k) < v)
m_order.push_back(std::make_pair(k, v - solver.bound_max(k)));
}
return length(m_order);
} | 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
movq %rcx, 0x18(%rsp)
movq %rax, 0x28(%rsp)
cmpq 0x28(%rsp), %r12
je 0x8582d
movq 0x18(%rsp), %rsi
movq %rsp, %rdi
movl %r12d, %edx
movq %r12, 0x30(%rsp)
callq 0x3de66
movq (%rsp), %r13
movq 0x8(%rsp), %r12
xorl %ebx, %ebx
cmpq %r13, %r12
je 0x857e1
movslq (%r12), %rax
movq 0x48(%r15), %rcx
movl 0x4(%r12), %esi
movq %r14, %rdi
movl (%rcx,%rax,4), %ebp
callq 0x3664a
imull %ebp, %eax
addq $0x8, %r12
addl %eax, %ebx
jmp 0x857b9
movq 0x30(%rsp), %r12
movq 0x58(%r15), %rcx
imulq $0xc, %r12, %rdx
movl (%rcx,%rdx), %eax
subl %ebx, %eax
jle 0x85802
shlq $0x20, %rax
orq %r12, %rax
movq %rax, (%rsp)
jmp 0x85813
subl 0x4(%rcx,%rdx), %ebx
jle 0x85820
shlq $0x20, %rbx
orq %r12, %rbx
movq %rbx, (%rsp)
movq 0x10(%rsp), %rdi
movq %rsp, %rsi
callq 0x3c8c2
movq 0x20(%rsp), %rdi
incq %r12
jmp 0x8578e
movq 0x20(%rdi), %rax
subq 0x18(%rdi), %rax
shrq $0x3, %rax
addq $0x38, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
| /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*, std::vector<int, std::allocator<int>>>, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>, double, double, double) | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
for (; first != last; ++first) {
auto k = constraint(first);
bx_expects(k < m);
auto [row_begin, row_end] = ap.row(k);
decrease_preference(row_begin, row_end, theta);
int r_size = 0;
for (auto it = row_begin; it != row_end; ++it, ++r_size) {
Float sum_a_p = 0;
auto [col_begin, col_end] = ap.column(it->column);
for (; col_begin != col_end; ++col_begin)
sum_a_p += static_cast<Float>(A[col_begin->value]) *
P[col_begin->value];
R[r_size].id = r_size;
R[r_size].a = A[it->value];
R[r_size].value = c(row_begin->column, x) - sum_a_p;
}
calculator_sort<Mode>(R.get(), R.get() + r_size, rng);
int value = 0;
bool valid = b[k].min <= 0;
int i = -1;
// if (!valid) {
// do {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value;
// } while (!valid && i + 1 < r_size);
// }
// valid = b[k].min <= value && value <= b[k].max;
// while (i + 1 < r_size && valid) {
// ++i;
// value += R[i].a;
// valid = b[k].min <= value && value <= b[k].max;
// }
// std::uniform_real_distribution<Float> real_dist(Float{ 0 },
// Float{ 1 });
// auto selected = i;
// auto d = delta;
// if (selected < 0) {
// d += (kappa / (one - kappa)) * (R[0].value / two);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
// } else if (selected + 1 >= r_size) {
// d += (kappa / (one - kappa)) * (R[selected].value * middle);
// d *= real_dist(rng);
// for (i = 0; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// } else {
// d += (kappa / (one - kappa)) *
// (R[selected + 1].value - R[selected].value);
// d *= real_dist(rng);
// for (i = 0; i <= selected; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 0);
// P[var->value] -= d;
// } else {
// x.set(var->column, 1);
// P[var->value] += d;
// }
// }
// for (; i != r_size; ++i) {
// auto var = row_begin + R[i].id;
// if (R[i].is_negative()) {
// x.set(var->column, 1);
// P[var->value] += d;
// } else {
// x.set(var->column, 0);
// P[var->value] -= d;
// }
// }
constexpr Float one{ 1 };
constexpr Float two{ 2 };
if (!valid) {
do {
++i;
value += R[i].a;
valid = b[k].min <= value;
auto var = row_begin + R[i].id;
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} while (!valid && i + 1 < r_size);
}
valid = b[k].min <= value && value <= b[k].max;
while (i + 1 < r_size && valid) {
++i;
value += R[i].a;
valid = b[k].min <= value && value <= b[k].max;
auto var = row_begin + R[i].id;
if (valid)
valid = stop_iterating<Mode>(R[i].value, rng);
if (valid) {
x.set(var->column);
P[var->value] +=
delta + (kappa / (one - kappa)) * (R[i].value / two);
} else {
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
}
while (i + 1 < r_size) {
++i;
auto var = row_begin + R[i].id;
x.unset(var->column);
P[var->value] -=
delta + (kappa / (one - kappa)) * (R[i].value / two);
}
bx_expects(is_valid_constraint(*this, k, x));
}
return false;
} | 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)
vsubsd %xmm0, %xmm1, %xmm1
vdivsd %xmm1, %xmm0, %xmm0
vmovsd %xmm0, 0x18(%rsp)
cmpq 0x60(%rsp), %rdx
je 0x85c61
movslq (%rdx), %rax
cmpl 0x80(%r12), %eax
jge 0x85c75
leaq 0x28(%rsp), %rdi
movq %rdx, 0x68(%rsp)
movq %r15, %rsi
movl %eax, %edx
movq %rax, 0x40(%rsp)
callq 0x3de66
vmovsd 0x58(%rsp), %xmm0
movq 0x28(%rsp), %rdx
movq 0x30(%rsp), %rsi
movq %r12, %rdi
callq 0x85cfa
movq 0x30(%rsp), %rbx
xorl %r14d, %r14d
cmpq 0x28(%rsp), %rbx
je 0x8599a
movl 0x4(%rbx), %edx
leaq 0x78(%rsp), %rdi
movq %r15, %rsi
callq 0x3dede
movq 0x78(%rsp), %rcx
movq 0x80(%rsp), %rdx
movq 0x48(%r12), %rax
movq 0x68(%r12), %rsi
vxorpd %xmm1, %xmm1, %xmm1
cmpq %rcx, %rdx
je 0x85945
movslq (%rdx), %rdi
addq $0x8, %rdx
vcvtsi2sdl (%rax,%rdi,4), %xmm3, %xmm0
vfmadd231sd (%rsi,%rdi,8), %xmm0, %xmm1 # xmm1 = (xmm0 * mem) + xmm1
movq %rdx, 0x80(%rsp)
jmp 0x85924
movq 0x50(%r12), %rcx
movq %r14, %rbp
shlq $0x4, %r14
vmovsd %xmm1, (%rsp)
movl %ebp, 0x8(%rcx,%r14)
movslq (%rbx), %rdx
movl (%rax,%rdx,4), %eax
movq %r13, %rdx
movl %eax, 0xc(%rcx,%r14)
movq 0x30(%rsp), %rax
movq 0x70(%r12), %rdi
movl 0x4(%rax), %esi
callq 0x73084
vsubsd (%rsp), %xmm0, %xmm0
movq 0x50(%r12), %rax
addq $0x8, %rbx
vmovsd %xmm0, (%rax,%r14)
movq %rbp, %r14
incq %r14
jmp 0x858ee
movq 0x50(%r12), %rdi
movq (%r12), %rdx
movl %r14d, %esi
shlq $0x4, %rsi
addq %rdi, %rsi
callq 0x85d17
imulq $0xc, 0x40(%rsp), %rdx
movq 0x58(%r12), %rax
cmpl $0x0, (%rax,%rdx)
movq %rdx, 0x48(%rsp)
jle 0x85a9d
leal -0x2(%r14), %eax
movabsq $-0x100000000, %r15 # imm = 0xFFFFFFFF00000000
movq %r14, 0x38(%rsp)
xorl %r14d, %r14d
cltq
movq %rax, 0x70(%rsp)
movq 0x50(%r12), %rax
pushq $-0x1
popq %rbx
xorl %ebp, %ebp
movabsq $0x100000000, %rcx # imm = 0x100000000
movq 0x30(%rsp), %r13
movq 0x8(%rsp), %rdi
addl 0xc(%rax,%r14), %ebp
addq %rcx, %r15
movq 0x58(%r12), %rcx
movslq 0x8(%rax,%r14), %r12
movl (%rcx,%rdx), %ecx
movl 0x4(%r13,%r12,8), %esi
movl %ecx, (%rsp)
callq 0x369c8
movq 0x10(%rsp), %rax
movslq (%r13,%r12,8), %rcx
movq 0x10(%rsp), %r12
vmovsd 0x3d2f38(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
movq 0x50(%rax), %rax
movq 0x68(%r12), %rdx
vmulsd (%rax,%r14), %xmm0, %xmm0
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rdx,%rcx,8), %xmm0, %xmm0
vmovsd %xmm0, (%rdx,%rcx,8)
movq 0x48(%rsp), %rdx
cmpl %ebp, (%rsp)
jle 0x85a86
addq $0x10, %r14
leaq 0x1(%rbx), %rcx
cmpq 0x70(%rsp), %rbx
movq %rcx, %rbx
jl 0x859f3
movq 0x58(%r12), %rax
sarq $0x20, %r15
cmpl %ebp, (%rax,%rdx)
jle 0x85aa5
movq 0x38(%rsp), %r14
xorl %eax, %eax
jmp 0x85ab1
xorl %ebp, %ebp
pushq $-0x1
popq %r15
jmp 0x85aaa
movq 0x38(%rsp), %r14
cmpl 0x4(%rax,%rdx), %ebp
setle %al
movslq %r14d, %rcx
movq %r15, %r14
shlq $0x4, %r14
leaq 0x1(%r15), %rbx
movq %rcx, (%rsp)
incq %r15
cmpq (%rsp), %r15
jae 0x85bc5
testb $0x1, %al
je 0x85bc5
movq 0x50(%r12), %rax
movq 0x58(%r12), %rcx
addl 0x1c(%rax,%r14), %ebp
cmpl %ebp, (%rcx,%rdx)
jle 0x85afc
movslq 0x18(%rax,%r14), %r13
shlq $0x3, %r13
addq 0x30(%rsp), %r13
jmp 0x85b6c
movslq 0x18(%rax,%r14), %r13
addq %rdx, %rcx
shlq $0x3, %r13
addq 0x30(%rsp), %r13
cmpl 0x4(%rcx), %ebp
jg 0x85b6c
vmovsd 0x10(%rax,%r14), %xmm0
movq (%r12), %rdi
callq 0x7c6e4
testb %al, %al
je 0x85b6c
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x369c8
movq 0x50(%r12), %rax
vmovsd 0x3d2e37(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vaddsd (%rcx,%rax,8), %xmm0, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
movb $0x1, %al
jmp 0x85bb4
movl 0x4(%r13), %esi
movq 0x8(%rsp), %rdi
callq 0x36a06
movq 0x50(%r12), %rax
vmovsd 0x3d2df1(%rip), %xmm0 # 0x458978
movq 0x68(%r12), %rcx
vmovsd 0x18(%rsp), %xmm1
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r13), %rax
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
xorl %eax, %eax
movq 0x48(%rsp), %rdx
addq $0x10, %r14
incq %rbx
jmp 0x85ac3
movq 0x8(%rsp), %r13
cmpq (%rsp), %rbx
jae 0x85c3a
movq 0x50(%r12), %rax
movq 0x30(%rsp), %r15
movq %r13, %rdi
movslq 0x18(%rax,%r14), %r12
movl 0x4(%r15,%r12,8), %esi
callq 0x36a06
movq 0x10(%rsp), %rax
movq 0x10(%rsp), %rcx
vmovsd 0x3d2d7a(%rip), %xmm0 # 0x458978
vmovsd 0x18(%rsp), %xmm1
incq %rbx
movq 0x50(%rax), %rax
movq 0x68(%rcx), %rcx
vmulsd 0x10(%rax,%r14), %xmm0, %xmm0
movslq (%r15,%r12,8), %rax
movq 0x10(%rsp), %r12
addq $0x10, %r14
vfmadd213sd 0x20(%rsp), %xmm1, %xmm0 # xmm0 = (xmm1 * xmm0) + mem
vmovsd (%rcx,%rax,8), %xmm1
vsubsd %xmm0, %xmm1, %xmm0
vmovsd %xmm0, (%rcx,%rax,8)
jmp 0x85bca
movq 0x40(%rsp), %rsi
movq %r12, %rdi
movq %r13, %rdx
callq 0x84961
testb %al, %al
je 0x85c96
movq 0x68(%rsp), %rdx
movq 0x50(%rsp), %r15
addq $0x4, %rdx
jmp 0x85899
xorl %eax, %eax
addq $0x88, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
leaq 0x3d2562(%rip), %rdi # 0x4581de
leaq 0x3d47f7(%rip), %rsi # 0x45a47a
leaq 0x3d45bd(%rip), %rdx # 0x45a247
leaq 0x3d47ef(%rip), %rcx # 0x45a480
callq 0x2813f
leaq 0x3d2541(%rip), %rdi # 0x4581de
leaq 0x3d47e0(%rip), %rsi # 0x45a484
leaq 0x3d459c(%rip), %rdx # 0x45a247
leaq 0x3d47f3(%rip), %rcx # 0x45a4a5
callq 0x2813f
nop
| /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::itm::quadratic_cost_type<double>> const&, baryonyx::bit_array const&) | 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
popq %rbx
popq %r14
popq %r15
popq %rbp
retq
| /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_data*, baryonyx::itm::solver_random_inequalities_101coeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>::rc_data*, std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&) | 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;
}
}
std::shuffle(ret, begin, rng);
} | 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 %rbx, %rdx
callq 0x862a6
popq %rbx
popq %r14
popq %r15
retq
jmp 0x85d95
movq %rax, %rdi
callq 0xeb9f
| /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_data[i].hash == hash)
return false;
return true;
} | 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
vmovsd 0x10(%rcx,%rdx), %xmm0
vucomisd %xmm1, %xmm0
jne 0x87742
jp 0x87742
cmpq %rbx, 0x20(%rcx,%rdx)
je 0x87748
addq $0x38, %rdx
jmp 0x87721
cmpq %rdx, %rax
leaq 0x8(%rsp), %rdi
sete %bl
callq 0x3c450
movl %ebx, %eax
addq $0x18, %rsp
popq %rbx
popq %r14
retq
movq %rax, %rdi
callq 0xeb9f
| /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: {}) {}s in {} loops\n",
value,
hash,
duration,
loop);
int id_to_delete = m_indices[choose_a_bad_solution(ctx)];
to_log(stdout,
5u,
"- delete {} ({})\n",
id_to_delete,
m_data[id_to_delete].value);
replace_result(id_to_delete, x, value, duration, hash, loop, 0);
sort();
} | 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 (%r12), %rdi
leaq 0x3d2d17(%rip), %rcx # 0x45a4ca
pushq $0x5
popq %rsi
pushq $0x30
popq %rdx
movq %rax, %r8
pushq %r11
pushq %r10
callq 0x3fb9e
popq %rax
popq %rcx
leaq 0x68(%r15), %rdi
movq %r15, %rsi
callq 0x3fce2
movq 0x38(%rbx), %rcx
cltq
leaq 0x4(%rsp), %r8
movq (%r12), %rdi
movslq (%rcx,%rax,4), %rax
movl %eax, (%r8)
imulq $0x38, %rax, %rax
movq 0x50(%rbx), %rcx
leaq 0x10(%rcx,%rax), %r9
leaq 0x3d2cfe(%rip), %rcx # 0x45a4fb
pushq $0x5
popq %rsi
pushq $0x11
popq %rdx
callq 0x3c388
vmovsd 0x18(%rsp), %xmm0
vmovsd 0x10(%rsp), %xmm1
movl 0x4(%rsp), %esi
movq 0x20(%rsp), %rcx
movq 0x8(%rsp), %r8
movq %rbx, %rdi
movq %r14, %rdx
xorl %r9d, %r9d
callq 0x8784c
movq %rbx, %rdi
callq 0x8204a
addq $0x28, %rsp
popq %rbx
popq %r12
popq %r14
popq %r15
retq
movq %rax, %rdi
callq 0xeb9f
| /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.