name string | code string | asm string | file string |
|---|---|---|---|
baryonyx::result baryonyx::itm::optimize_problem<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>>(baryonyx::context const&, baryonyx::problem const&) | inline result
optimize_problem(const context& ctx, const problem& pb)
{
result r;
if (ctx.start)
ctx.start(ctx.parameters);
auto constraints{ make_merged_constraints(ctx, pb) };
if (constraints.empty() || pb.vars.values.empty()) {
r.status = result_status::success;
r.solutions.... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x188, %rsp # imm = 0x188
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, %r13
movq %rsi, %r15
movq %rdi, %r12
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>::compute_update_row<baryonyx::bit_array, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>>(baryonyx::bit_array&, std::reverse_iterator... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x38(%rsp)
leaq 0x50(%rsp), %rcx
leaq 0x48(%rsp), %r8
leaq 0x40(%rsp), %r9
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
leaq 0xa18de(%rip), %rdx # 0x44f186
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r8)
vmovsd %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryonyx::bit_arra... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x38(%rsp)
leaq 0x50(%rsp), %rcx
leaq 0x48(%rsp), %r8
leaq 0x40(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0xa1442(%rip), %rdx # 0x44f186
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r8)
vmovsd %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_... | 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 0x170(%r14), %r15d
je 0x3ae2d5
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x3ad7eb
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x3ae2b2
movl %ebp, %eax
addq $0x8, ... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::maximize_tag, double>::make_init_node_1() | void make_init_node_1()
{
nodes.emplace_back(items[0].r, items[0].factor, 0u);
nodes.back().variables = subvector.emplace();
nodes.back().z = items[0].sum_z;
subvector.fill(nodes.back().variables, 0);
subvector[nodes.back().variables] = 1;
} | pushq %rbx
subq $0x10, %rsp
movq %rdi, %rbx
movq 0x20(%rbx), %rsi
leaq 0xc(%rsp), %rcx
addq $0x38, %rdi
andl $0x0, (%rcx)
leaq 0x10(%rsi), %rdx
callq 0x3b01e2
movq %rbx, %rdi
callq 0x362e68
movq 0x40(%rbx), %rcx
movl %eax, -0x20(%rcx)
movq 0x20(%rbx), %rdx
vmovsd 0x8(%rdx), %xmm0
vmovsd %xmm0, -0x18(%rcx)
movl 0x18(%rb... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::maximize_tag, double>::make_next_inequality_node() | void make_next_inequality_node()
{
node& node_0 = nodes.back();
const unsigned level = node_0.level + 1;
if (level >= subvector.element_size()) {
subvector.remove(node_0.variables);
nodes.pop_back();
return;
}
node_0.level = level;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x10, %rsp
movq 0x40(%rdi), %rax
movq %rdi, %rbx
movl -0x4(%rax), %edx
leal 0x1(%rdx), %ecx
movl %ecx, (%rsp)
movl 0x18(%rdi), %esi
cmpl %esi, %ecx
jae 0x3b04f8
movl %ecx, -0x4(%rax)
leaq 0x38(%rbx), %rdi
addl $0x2, %edx
vmovsd -0x10(%rax), %xmm0
vmovsd %xmm0, -0x18(%rax)
cmpl %es... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
void fmt::v7::print<std::basic_string_view<char, std::char_traits<char>>, int const&, int const&, double const&, double const&, double const&, char>(_IO_FILE*, std::basic_string_view<char, std::char_traits<char>> const&, int const&, int const&, double const&, double const&, double const&) | inline void print(std::FILE* f, const S& format_str, Args&&... args) {
const auto& vargs = fmt::make_args_checked<Args...>(format_str, args...);
return detail::is_unicode<Char>()
? vprint(f, to_string_view(format_str), vargs)
: detail::vprint_mojibake(f, to_string_view(format_str), vargs);... | subq $0x58, %rsp
movq 0x60(%rsp), %rax
movq (%r8), %r10
movl (%rdx), %edx
movl (%rcx), %ecx
movq (%r9), %r9
movq %rsp, %r8
movq (%rax), %rax
movq %rdx, (%r8)
movq %rcx, 0x10(%r8)
movq %r10, 0x20(%r8)
movq %r9, 0x30(%r8)
movl $0xaaa11, %ecx # imm = 0xAAA11
movq %rax, 0x40(%r8)
movq (%rsi), %rdx
movq 0x8(%rsi), ... | /quesnel[P]baryonyx/external/fmt/include/fmt/core.h |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>::push_and_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... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movq %rcx, 0x48(%rsp)
leaq 0x60(%rsp), %rcx
leaq 0x58(%rsp), %r8
leaq 0x50(%rsp), %r9
movq %rdx, %r14
movq %rdi, %r12
vmovsd %xmm3, 0x40(%rsp)
movq %rsi, 0x30(%rsp)
leaq 0x9c593(%rip), %rdx # 0x44f181
vmovsd %xmm0, (%rcx)
vmovsd %xmm... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>, double, baryonyx::itm::maximize_tag, baryonyx::itm::default_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 0x3b5bb0
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3b5c2a
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, true>, double, baryonyx::itm::maximize_tag, baryonyx::itm::default_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 0x3b5c92
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3b5d0c
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, baryonyx::bit_array, double>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<dou... | int push_and_run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta,
Float objective_amplifier)
{
bool pi_changed = 0;
int remaining = 0;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0x3b6d9a
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 0x3b6f33
leaq 0xa1f7c(%rip)... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, f... | 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 0x3b7266
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x170(%r15), %esi
je 0x3b729c
movq %r15, %rdi
movq %r14, %rdx
callq 0x3b72b3
testb... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x3b79dc
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x170(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::branch_and_bound_solver<baryonyx::itm::maximize_tag, double>::solve<std::unique_ptr<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>::rc_data [], std::default_delete<baryonyx::itm::solver_inequalities_Zcoeff<double, baryon... | int solve(R& reduced_cost, int r_size, int bk_min, int bk_max)
{
bx_assert(r_size >= 4);
bx_assert(bk_min <= bk_max);
b_min = bk_min;
b_max = bk_max;
items.resize(r_size);
if (!subvector.init(r_size))
throw solver_failure(solver_error_tag::no_solver_avai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
cmpl $0x3, %edx
jle 0x3b80b0
cmpl %r8d, %ecx
jg 0x3b80d1
leaq 0x20(%rdi), %r13
movl %ecx, 0x64(%rdi)
movl %edx, %ebx
movq %rsi, %r14
movl %edx, %r12d
movq %rdi, %r15
movl %r8d, 0x68(%rdi)
movq %r12, %rsi
movq %r13, %rdi
callq 0x3af3f6
movq %r1... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>::rc_data*>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>::rc_data*, ... | inline void
random_shuffle_unique(iteratorT begin,
iteratorT end,
random_engine& rng) noexcept
{
auto ret = begin++;
for (; begin != end; ++begin) {
if (ret->value != begin->value) {
std::shuffle(ret, begin, rng);
ret = begin;
}... | pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
leaq 0x10(%rdi), %rsi
cmpq %r14, %rsi
je 0x3b8708
vmovsd (%rdi), %xmm0
leaq 0x10(%rsi), %r15
vucomisd (%rsi), %xmm0
movq %r15, %rsi
jne 0x3b86f4
jnp 0x3b86dc
addq $-0x10, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x3b8c29
movq %r15, %rdi
jmp 0x3b86d8
mov... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movq %rcx, 0x60(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x58(%rsp)
vmovsd %xmm2, 0x50(%rsp)
vmovsd %xmm1, 0x48(%rsp)
vmovsd %xmm0, 0x40(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdi, ... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>::push_and_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 c... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movq %rcx, 0x60(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x58(%rsp)
vmovsd %xmm2, 0x50(%rsp)
vmovsd %xmm1, 0x48(%rsp)
vmovsd %xmm0, 0x40(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdi, ... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::maximize_tag, baryonyx::itm::default_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 0x3bdfb2
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3be02c
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::maximize_tag, baryonyx::itm::default_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 0x3be094
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3be10e
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::maximize_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 0x9540
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x8e7c9(%rip), %xmm1, %xmm1 # 0x44c8c0
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
popq... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>(baryonyx::context const&, baryonyx::problem const&) | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x140, %rsp # imm = 0x140
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0x3be8aa
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x274f4
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorder<b... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x268, %rsp # imm = 0x268
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 0x28b24
movq (%rbp), %r13
movq %rbp, 0x58... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, baryonyx::bit_array, double>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<... | int push_and_run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta,
Float objective_amplifier)
{
bool pi_changed = 0;
int remaining = 0;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0x3c0528
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 0x3c06c1
leaq 0x988b6(%rip)... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true> const, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, b... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x3c08fa
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x170(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true> ... | 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 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdi, %rbx
movl %edx, 0x4(%rsp)
movq %r15, %rdi
callq 0x31caa
movq (%r15), %r12
movq 0x8(%r15), %r13
xorl %r15d, %r15d
cmpq %r12, %r13
je 0x3c0aa2
movslq (%r... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int const*, s... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x38(%rsp)
leaq 0x50(%rsp), %rcx
leaq 0x48(%rsp), %r8
leaq 0x40(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0x8dea0(%rip), %rdx # 0x44f186
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r8)
vmovsd %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
int baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::compute_reduced_costs<baryonyx::bit_array>(baryonyx::sparse_matrix<int>::row_value*, baryonyx::sparse_matrix<int>::row_value*, baryonyx::bit_array const&) | int compute_reduced_costs(sparse_matrix<int>::row_iterator begin,
sparse_matrix<int>::row_iterator end,
const Xtype& x) noexcept
{
// to_log(
// debug_os, " compute-reduced-cost {}\n", std::distance(begin,
// end));
int ... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x28, %rsp
leaq 0x10(%rdi), %rbp
movq %rcx, 0x8(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r13
xorl %ebx, %ebx
cmpq %r14, %r15
je 0x3c163c
movl 0x4(%r15), %edx
leaq 0x18(%rsp), %rdi
movq %rbp, %rsi
callq 0x33320
vmovddup 0x8b352(%rip), %xmm2... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::rc_data*>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::rc_data*... | inline void
random_shuffle_unique(iteratorT begin,
iteratorT end,
random_engine& rng) noexcept
{
auto ret = begin++;
for (; begin != end; ++begin) {
if (ret->value != begin->value) {
std::shuffle(ret, begin, rng);
ret = begin;
}... | pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
leaq 0x10(%rdi), %rsi
cmpq %r14, %rsi
je 0x3c1fb3
vmovsd (%rdi), %xmm0
leaq 0x10(%rsi), %r15
vucomisd (%rsi), %xmm0
movq %r15, %rsi
jne 0x3c1f9f
jnp 0x3c1f87
addq $-0x10, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x3c24d4
movq %r15, %rdi
jmp 0x3c1f83
mov... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
double baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::local_compute_reduced_cost<baryonyx::bit_array>(int, baryonyx::bit_array const&) | Float local_compute_reduced_cost(int variable, const Xtype& x) noexcept
{
Float sum_a_pi_p = 0;
for (auto [ht, hte] = ap.column(variable); ht != hte; ++ht) {
auto a = std::abs(static_cast<Float>(A[ht->value]));
sum_a_pi_p += a * (pi[ht->row] + P[ht->value]);
}
... | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x18, %rsp
movl %esi, %ebp
leaq 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdx, %rbx
movq %rdi, %r14
movl %ebp, %edx
movq %r15, %rdi
callq 0x33320
vmovddup 0x89329(%rip), %xmm0 # xmm0 = mem[0,0]
movq (%r15), %rax
movq 0x8(%r15), %rcx
movq 0x50(%r14), %rdx
movq 0x58(... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::push_and_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::rever... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x50(%rsp)
leaq 0x70(%rsp), %rcx
leaq 0x68(%rsp), %r8
leaq 0x60(%rsp), %r9
movq %rdx, %rbx
vmovsd %xmm3, 0x58(%rsp)
movq %rsi, %r15
movq %rdi, %r12
leaq 0x8a855(%rip), %rdx # 0x44f181
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm::merged_constrai... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x268, %rsp # imm = 0x268
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorder<... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x268, %rsp # imm = 0x268
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 0x28b24
movq (%rbp), %r13
movq %rbp, 0x58... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0x3c895a
movq %rax, %rdi
jmp 0x3c8f6a
cmpl $0x7, %ecx
jne 0x3c8977
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x3c8985
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x3c8968
movq %rsi, %rdi
movq %rdx, %rsi
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false> const, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, ... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x3c8f8c
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x170(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false... | 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 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdi, %rbx
movl %edx, 0x4(%rsp)
movq %r15, %rdi
callq 0x31caa
movq (%r15), %r12
movq 0x8(%r15), %r13
xorl %r15d, %r15d
cmpq %r12, %r13
je 0x3c9134
movslq (%r... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::vector<... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
leaq 0x10(%rdi), %rax
vmovsd %xmm2, 0x48(%rsp)
vmovsd %xmm1, 0x40(%rsp)
vmovsd %xmm0, 0x38(%rsp)
movq %rcx, 0x50(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
movq %rax, 0x30(%rsp)
leaq 0x60(%rdi), %rax
movq %rax, (%rsp)
leaq 0xf... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
int baryonyx::itm::branch_and_bound_solver<baryonyx::itm::maximize_tag, double>::solve<std::unique_ptr<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::rc_data [], std::default_delete<baryonyx::itm::solver_inequalities_Zcoeff<double, bary... | int solve(R& reduced_cost, int r_size, int bk_min, int bk_max)
{
bx_assert(r_size >= 4);
bx_assert(bk_min <= bk_max);
b_min = bk_min;
b_max = bk_max;
items.resize(r_size);
if (!subvector.init(r_size))
throw solver_failure(solver_error_tag::no_solver_avai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
cmpl $0x3, %edx
jle 0x3c9ede
cmpl %r8d, %ecx
jg 0x3c9eff
leaq 0x20(%rdi), %r13
movl %ecx, 0x64(%rdi)
movl %edx, %ebx
movq %rsi, %r14
movl %edx, %r12d
movq %rdi, %r15
movl %r8d, 0x68(%rdi)
movq %r12, %rsi
movq %r13, %rdi
callq 0x3af3f6
movq %r1... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::select_variables(int, int, int) | int select_variables(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[i + ... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rsi, %r9
jge 0x3ca1bb
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x3ca1ae
vucomisd (%rdi), %xmm0
ja 0x3ca1bb
addl 0xc(%rdi)... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::push_and_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::reve... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
leaq 0x10(%rdi), %rax
movq %rcx, 0x68(%rsp)
leaq 0x60(%rdi), %rcx
movq %rsi, %r15
leaq 0xf0(%rdi), %rsi
vmovsd %xmm3, 0x70(%rsp)
vmovsd %xmm2, 0x60(%rsp)
vmovsd %xmm1, 0x58(%rsp)
vmovsd %xmm0, 0x50(%rsp)
movq %rdi, %r12
movq %rdx, 0x48(%... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x68(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x70(%rsp)
vmovsd %xmm2, 0x60(%rsp)
vmovsd %xmm1, 0x58(%rsp)
vmovsd %xmm0, 0x50(%rsp)
movq %rsi, %r15
movq %rdi, %r12
x... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryon... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x68(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x70(%rsp)
vmovsd %xmm2, 0x60(%rsp)
vmovsd %xmm1, 0x58(%rsp)
vmovsd %xmm0, 0x50(%rsp)
movq %rsi, %r15
movq %rdi, %r12
x... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::push_and_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... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x68(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x70(%rsp)
vmovsd %xmm2, 0x60(%rsp)
vmovsd %xmm1, 0x58(%rsp)
vmovsd %xmm0, 0x50(%rsp)
movq %rsi, %r15
movq %rdi, %r12
x... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<double>, baryonyx::pnm_observer>::store_if_better(baryonyx::bit_array const&, double, l... | 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 0x3cfed8
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3cff52
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::result baryonyx::itm::optimize_problem<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>(baryonyx::context const&, baryonyx::problem const&) | inline result
optimize_problem(const context& ctx, const problem& pb)
{
result r;
if (ctx.start)
ctx.start(ctx.parameters);
auto constraints{ make_merged_constraints(ctx, pb) };
if (constraints.empty() || pb.vars.values.empty()) {
r.status = result_status::success;
r.solutions.... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x188, %rsp # imm = 0x188
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, %r13
movq %rsi, %r15
movq %rdi, %r12
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::result baryonyx::itm::optimize_problem<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>(baryonyx::context const&, baryonyx::problem const&) | inline result
optimize_problem(const context& ctx, const problem& pb)
{
result r;
if (ctx.start)
ctx.start(ctx.parameters);
auto constraints{ make_merged_constraints(ctx, pb) };
if (constraints.empty() || pb.vars.values.empty()) {
r.status = result_status::success;
r.solutions.... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x188, %rsp # imm = 0x188
vxorpd %xmm0, %xmm0, %xmm0
movq %rdx, %r13
movq %rsi, %r15
movq %rdi, %r12
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
movq $0x7fffffff, 0x98(%rdi) # imm = 0x7FFFFFFF
movl $0x2, 0xa... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
baryonyx::itm::optimize_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>>::operator()(std::atomic<bool> const&, baryonyx::itm::best_solution_recorder<baryo... | void operator()(const std::atomic_bool& stop_task,
best_solution_recorder<Cost, Float, Mode>& best_recorder,
const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_const... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x258, %rsp # imm = 0x258
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 0x28b24
movq (%rbp), %r13
movq %rbp, 0x58... | /quesnel[P]baryonyx/lib/src/itm-optimizer-common.hpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true> cons... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0x3d21d2
movq %rax, %rdi
jmp 0x3d2f96
cmpl $0x7, %ecx
jne 0x3d21ef
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x3d21fd
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x3d21e0
movq %rsi, %rdi
movq %rdx, %rsi
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true> const, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, bar... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x3d2fb8
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x170(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryonyx::bit_arra... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
movq %rcx, 0x38(%rsp)
leaq 0x50(%rsp), %rcx
leaq 0x48(%rsp), %r8
leaq 0x40(%rsp), %r9
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0x7bb2a(%rip), %rdx # 0x44f186
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r8)
vmovsd %xmm2, (%r9)
pu... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>::local_affect<baryonyx::bit_array, baryonyx::sparse_matrix<int>::row_value*>(baryonyx::bit_array&, baryonyx::sparse_matrix<int>::row_value*, int, int, int, double, double) | bool local_affect(Xtype& x,
Iterator it,
int k,
int selected,
int r_size,
const Float kappa,
const Float delta)
{
constexpr Float one{ 1 };
constexpr Float two{ 2 };
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
vmovsd 0x74ee8(%rip), %xmm2 # 0x4491b0
movl %r8d, 0x14(%rsp)
movl %r9d, 0x10(%rsp)
movq %rdx, %r15
movslq %ecx, %rdx
movl %ecx, 0x24(%rsp)
movq %rsi, %r14
movq %rdi, %rbx
movq 0x78(%rdi), %rcx
movq %rdx, 0x28(%rsp)
leaq (%rcx,%rdx,8),... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, double>::solve_equality() | void solve_equality()
{
lower_bound = compute_lower_bound();
upper_bound = compute_upper_bound();
make_init_node_0();
if (nodes.back().sumfactor == b_min) {
upper_bound = nodes.back().sumr;
subvector.copy(nodes.back().variables, solution);
subvect... | pushq %rbx
movabsq $0x7ff0000000000000, %rax # imm = 0x7FF0000000000000
movq %rdi, %rbx
movq %rax, 0x58(%rdi)
callq 0x3d56d4
movq %rbx, %rdi
vmovsd %xmm0, 0x50(%rbx)
callq 0x3d570e
movq 0x40(%rbx), %rax
movl -0x8(%rax), %ecx
cmpl 0x64(%rbx), %ecx
jne 0x3d4db0
vmovsd -0x10(%rax), %xmm0
vmovsd %xmm0, 0x50(%rbx)
movl 0x18... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
void std::__move_median_to_first<__gnu_cxx::__normal_iterator<baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, double>::item*, std::vector<baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, double>::item, std::allocator<baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_t... | constexpr bool operator<(const item& other) const noexcept
{
if constexpr (std::is_same_v<Mode, minimize_tag>)
return (r / static_cast<Float>(factor)) <
(other.r / static_cast<Float>(factor));
else
return (other.r / static_cast<Float... | vcvtsi2sdl 0x10(%rsi), %xmm0, %xmm0
vmovsd (%rdx), %xmm1
vmovsd (%rsi), %xmm2
vunpcklpd %xmm1, %xmm2, %xmm2 # xmm2 = xmm2[0],xmm1[0]
vmovddup %xmm0, %xmm3 # xmm3 = xmm0[0,0]
vdivpd %xmm3, %xmm2, %xmm2
vshufpd $0x1, %xmm2, %xmm2, %xmm3 # xmm3 = xmm2[1,0]
vucomisd %xmm2, %xmm3
jbe 0x3d54b7
vcvtsi2sdl 0x10(%rdx... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, true>, 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 0x9540
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x712a3(%rip), %xmm1, %xmm1 # 0x44c8c0
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
popq... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::solver_inequalities_Zcoeff(std::linear_congruential_engine<unsigned long, 16807ul, 0ul, 2147483647ul>&, int, int, baryonyx::itm::default_cost_type<double> const&, std::vector<baryonyx::itm::m... | solver_inequalities_Zcoeff(random_engine& rng_,
int m_,
int n_,
const cost_type& c_,
const std::vector<merged_constraint>& csts)
: logger("solver_inequalities_Zcoeff")
, rng(rng_)
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
andq $0x0, (%rdi)
leaq 0x10(%rdi), %rbx
movq %rsi, 0x8(%rdi)
movq %rdi, %r15
movq %r8, %r14
movl %ecx, %ebp
movl %edx, %r12d
movq %r9, 0x28(%rsp)
movq %r9, %rsi
movq %rbx, %rdi
callq 0x2f90c
movl 0x38(%r15), %esi
leaq 0x50(%r15), %r13
mo... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::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_iterato... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
leaq 0x10(%rdi), %rax
movq %rcx, 0x50(%rsp)
leaq 0x60(%rdi), %rcx
movq %rsi, %r15
leaq 0xf0(%rdi), %rsi
vmovsd %xmm2, 0x48(%rsp)
vmovsd %xmm1, 0x40(%rsp)
vmovsd %xmm0, 0x38(%rsp)
movq %rdi, %r12
movq %rdx, 0x30(%rsp)
xorl %ebp, %ebp
movq... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::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_arr... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
leaq 0x10(%rdi), %rax
vmovsd %xmm2, 0x48(%rsp)
vmovsd %xmm1, 0x40(%rsp)
vmovsd %xmm0, 0x38(%rsp)
movq %rcx, 0x50(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
movq %rax, 0x30(%rsp)
leaq 0x60(%rdi), %rax
movq %rax, (%rsp)
leaq 0xf... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int const*, st... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x58, %rsp
leaq 0x10(%rdi), %rax
vmovsd %xmm2, 0x48(%rsp)
vmovsd %xmm1, 0x40(%rsp)
vmovsd %xmm0, 0x38(%rsp)
movq %rcx, 0x50(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
movq %rax, 0x30(%rsp)
leaq 0x60(%rdi), %rax
movq %rax, (%rsp)
leaq 0xf... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
int baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, double>::solve<std::unique_ptr<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::rc_data [], std::default_delete<baryonyx::itm::solver_inequalities_Zcoeff<double, baryon... | int solve(R& reduced_cost, int r_size, int bk_min, int bk_max)
{
bx_assert(r_size >= 4);
bx_assert(bk_min <= bk_max);
b_min = bk_min;
b_max = bk_max;
items.resize(r_size);
if (!subvector.init(r_size))
throw solver_failure(solver_error_tag::no_solver_avai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
cmpl $0x3, %edx
jle 0x3dd8f6
cmpl %r8d, %ecx
jg 0x3dd917
leaq 0x20(%rdi), %r13
movl %ecx, 0x64(%rdi)
movl %edx, %ebx
movq %rsi, %r14
movl %edx, %r12d
movq %rdi, %r15
movl %r8d, 0x68(%rdi)
movq %r12, %rsi
movq %r13, %rdi
callq 0x3d4d16
movq %r1... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::select_variables(int, int, int) | int select_variables(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[i + ... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rsi, %r9
jge 0x3ddbd7
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x3ddbca
vmovsd (%rdi), %xmm1
vucomisd %xmm0, %xmm1
ja 0x3... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std::... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x68, %rsp
movq %rcx, 0x60(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x58(%rsp)
vmovsd %xmm2, 0x50(%rsp)
vmovsd %xmm1, 0x48(%rsp)
vmovsd %xmm0, 0x40(%rsp)
movq %rsi, 0x30(%rsp)
movq %rdi, ... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>, double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm::merged_constraint,... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x258, %rsp # imm = 0x258
vmovsd %xmm0, 0x40(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x8(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
m... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<double>, false>, 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 0x3e39d0
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x3e3a4a
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r1... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>>(baryonyx::context const&, baryonyx::problem const&) | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x140, %rsp # imm = 0x140
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0x3e4104
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x274f4
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true> ... | 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 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdi, %rbx
movl %edx, 0x4(%rsp)
movq %r15, %rdi
callq 0x31caa
movq (%r15), %r12
movq 0x8(%r15), %r13
xorl %r15d, %r15d
cmpq %r12, %r13
je 0x3e62fc
movslq (%r... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadra... | 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 0x170(%r14), %r15d
je 0x3e6d89
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x3e629f
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x3e6d66
movl %ebp, %eax
addq $0x8, ... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::select_variables_101(int, int, int) | int select_variables_101(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
vxorpd %xmm0, %xmm0, %xmm0
cmpq %rsi, %r9
jge 0x3e7457
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x3e744a
vmovsd (%rdi), %xmm1
vucomisd %xmm0, %xmm1
ja 0x3... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>(baryony... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x50(%rsp)
leaq 0x70(%rsp), %rcx
leaq 0x68(%rsp), %r8
leaq 0x60(%rsp), %r9
movq %rdx, %rbx
vmovsd %xmm3, 0x58(%rsp)
movq %rsi, %r15
movq %rdi, %r12
leaq 0x64a81(%rip), %rdx # 0x44f181
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, true>::push_and_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 ... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x50(%rsp)
leaq 0x70(%rsp), %rcx
leaq 0x68(%rsp), %r8
leaq 0x60(%rsp), %r9
movq %rdx, %rbx
vmovsd %xmm3, 0x58(%rsp)
movq %rsi, %r15
movq %rdi, %r12
leaq 0x647c9(%rip), %rdx # 0x44f181
vmovsd %xmm0, (%rcx)
vmovsd %xmm1, (%r... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0x3ee1c6
movq %rax, %rdi
jmp 0x3ee7d6
cmpl $0x7, %ecx
jne 0x3ee1e3
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x3ee1f1
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x3ee1d4
movq %rsi, %rdi
movq %rdx, %rsi
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::push_and_run<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, baryonyx::bit_array, double>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type... | int push_and_run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta,
Float objective_amplifier)
{
bool pi_changed = 0;
int remaining = 0;
... | pushq %r15
pushq %r14
pushq %rbx
subq $0x30, %rsp
movl 0x30(%rdi), %eax
cmpb $0x1, 0x34(%rdi)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
jne 0x3ee42a
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 0x3ee5c3
leaq 0x6ad9c(%rip)... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryon... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x3ef06c
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x170(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
double baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::local_compute_reduced_cost<baryonyx::bit_array>(int, baryonyx::bit_array const&) | Float local_compute_reduced_cost(int variable, const Xtype& x) noexcept
{
Float sum_a_pi_p = 0;
for (auto [ht, hte] = ap.column(variable); ht != hte; ++ht) {
auto a = std::abs(static_cast<Float>(A[ht->value]));
sum_a_pi_p += a * (pi[ht->row] + P[ht->value]);
}
... | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
subq $0x18, %rsp
movl %esi, %ebp
leaq 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdx, %rbx
movq %rdi, %r14
movl %ebp, %edx
movq %r15, %rdi
callq 0x33320
vmovddup 0x5b533(%rip), %xmm0 # xmm0 = mem[0,0]
movq (%r15), %rax
movq 0x8(%r15), %rcx
movq 0x50(%r14), %rdx
movq 0x58(... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x78, %rsp
movq %rcx, 0x68(%rsp)
leaq 0x60(%rdi), %rcx
movq %rdx, %r14
leaq 0x10(%rdi), %rax
leaq 0xf0(%rdi), %rdx
vmovsd %xmm3, 0x70(%rsp)
vmovsd %xmm2, 0x60(%rsp)
vmovsd %xmm1, 0x58(%rsp)
vmovsd %xmm0, 0x50(%rsp)
movq %rsi, %r15
movq %rdi, %r12
x... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<double, baryonyx::itm::minimize_tag, baryonyx::itm::quadratic_cost_type<double>, false>, double, baryonyx::itm::minimize_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 0x9540
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x57027(%rip), %xmm1, %xmm1 # 0x44c8c0
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
popq... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::result baryonyx::itm::solve_problem<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>>(baryonyx::context const&, baryonyx::problem con... | inline result
solve_problem(const context& ctx, const problem& pb)
{
if (ctx.start)
ctx.start(ctx.parameters);
result ret;
auto variables = length(pb.vars.values);
auto constraints{ make_merged_constraints(ctx, pb) };
if (!constraints.empty() && !pb.vars.values.empty()) {
random_e... | pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x130, %rsp # imm = 0x130
cmpq $0x0, 0x128(%rsi)
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, %rbx
je 0x3f6044
leaq 0x118(%r14), %rdi
movq %r14, %rsi
callq 0x274f4
vxorps %xmm0, %xmm0, %xmm0
vmovups %zmm0, 0x58(%rbx)
vmovups %zmm0, 0x40(%rbx)
vmovups... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
int baryonyx::itm::compute_order::run<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, baryonyx::bit_array, long double>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cos... | int run(Solver& solver,
Xtype& x,
random_engine& rng,
Float kappa,
Float delta,
Float theta)
{
bool pi_changed = false;
int remaining = 0;
switch (order) {
case solver_parameters::constraint_order::reversing:
so... | pushq %r15
pushq %r14
pushq %rbx
subq $0x70, %rsp
fldt 0xb0(%rsp)
fldt 0xa0(%rsp)
fldt 0x90(%rsp)
movl 0x30(%rdi), %eax
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r14
decl %eax
cmpl $0x6, %eax
ja 0x3f7c59
leaq 0x61710(%rip), %rdx # 0x459284
movslq (%rdx,%rax,4), %rax
addq %rdx, %rax
jmpq *%rax
movq 0x8(%r14), %rax... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::is_valid_constraint<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long... | 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 0x10(%rdi), %rsi
leaq 0x8(%rsp), %r15
movq %rdi, %rbx
movl %edx, 0x4(%rsp)
movq %r15, %rdi
callq 0x31caa
movq (%r15), %r12
movq 0x8(%r15), %r13
xorl %r15d, %r15d
cmpq %r12, %r13
je 0x3f8b12
movslq (%r... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx... | int local_compute_violated_constraints(const Solver& slv, const Xtype& x)
{
int remaining = 0;
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
++remaining;
return remaining;
} | pushq %rbp
pushq %r15
pushq %r14
pushq %rbx
pushq %rax
movq %rdx, %rbx
movq %rsi, %r14
xorl %ebp, %ebp
xorl %r15d, %r15d
cmpl 0x180(%r14), %r15d
je 0x3f9641
movq %r14, %rdi
movl %r15d, %esi
movq %rbx, %rdx
callq 0x3f8ab5
xorb $0x1, %al
incl %r15d
movzbl %al, %eax
addl %eax, %ebp
jmp 0x3f961e
movl %ebp, %eax
addq $0x8, ... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>::select_variables_101(int, int, int) | int select_variables_101(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
fldz
cmpq %rsi, %r9
jge 0x3f9ced
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x3f9ce0
fldt (%rdi)
fxch %st(1)
fucomi %st(1), %st
fstp %st(1)
ja 0x3f9ced
addl... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::maximize_tag, long double>::make_init_node_0() | void make_init_node_0()
{
nodes.emplace_back(Float{ 0 }, 0, 0u);
nodes.back().variables = subvector.emplace();
nodes.back().z = items[1].sum_z;
subvector.fill(nodes.back().variables, 0);
} | pushq %rbx
subq $0x20, %rsp
fldz
fstpt 0x10(%rsp)
leaq 0xc(%rsp), %rdx
leaq 0x8(%rsp), %rcx
movq %rdi, %rbx
addq $0x38, %rdi
leaq 0x10(%rsp), %rsi
andl $0x0, (%rdx)
andl $0x0, (%rcx)
callq 0x3fb4c0
movq %rbx, %rdi
callq 0x362e68
movq 0x40(%rbx), %rcx
movl %eax, -0x40(%rcx)
movq 0x20(%rbx), %rdx
fldt 0x40(%rdx)
fstpt -0... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>::push_and_compute_update_row<baryonyx::bit_array, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>>(baryonyx::bit_array&, st... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa8, %rsp
movq %rcx, 0x58(%rsp)
movq %rsi, 0x48(%rsp)
movq %rdx, %r14
movq %rdi, %r12
leaq 0x50f33(%rip), %rdx # 0x44f181
fldt 0x110(%rsp)
fstpt 0x64(%rsp)
fldt 0x100(%rsp)
fldt 0xf0(%rsp)
fldt 0xe0(%rsp)
fstpt 0x90(%rsp)
fstpt 0x80(%rsp)
fstp... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>>>... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa8, %rsp
movq %rcx, 0x58(%rsp)
movq %rsi, 0x48(%rsp)
movq %rdx, %r14
movq %rdi, %r12
leaq 0x509bf(%rip), %rdx # 0x44f181
fldt 0x110(%rsp)
fstpt 0x64(%rsp)
fldt 0x100(%rsp)
fldt 0xf0(%rsp)
fldt 0xe0(%rsp)
fstpt 0x90(%rsp)
fstpt 0x80(%rsp)
fstp... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::file_observer>::operator()(std::vector<baryonyx::itm:... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x538, %rsp # imm = 0x538
vmovsd %xmm0, 0x88(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x60(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, true>, long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::pnm_observer>::store_if_better(baryonyx::bit_array co... | 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 0x40164a
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x4016c4
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r14)
addq $0x8, %rsp
p... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
void baryonyx::itm::compute_order::init<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<long double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::default_cost_type<lon... | void init(const Solver& s, const Xtype& x)
{
switch (order) {
case solver_parameters::constraint_order::infeasibility_decr:
case solver_parameters::constraint_order::infeasibility_incr:
infeasibility_local_compute_violated_constraints(s, x);
break;
case solver... | movl 0x30(%rdi), %ecx
movq %rdi, %rax
leal -0x3(%rcx), %edi
cmpl $0x2, %edi
jae 0x40268a
movq %rax, %rdi
jmp 0x402d0e
cmpl $0x7, %ecx
jne 0x4026a7
movq (%rax), %rcx
movq 0x8(%rax), %rax
xorl %edx, %edx
cmpq %rax, %rcx
je 0x4026b5
movl %edx, (%rcx)
incl %edx
addq $0x4, %rcx
jmp 0x402698
movq %rsi, %rdi
movq %rdx, %rsi
m... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>, true>::compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<int*, std... | bool compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta)
{
auto at_least_one_pi_changed{ false };
logger::log("u... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x98, %rsp
movq %rcx, 0x58(%rsp)
movq %rdx, %r14
movq %rsi, %r15
movq %rdi, %r12
leaq 0x4206a(%rip), %rdx # 0x44f186
fldt 0xf0(%rsp)
fldt 0xe0(%rsp)
fldt 0xd0(%rsp)
fstpt 0x80(%rsp)
fstpt 0x70(%rsp)
fstpt 0x60(%rsp)
pushq $0x14
popq %rsi
leaq 0... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
void baryonyx::itm::random_shuffle_unique<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>, true>::rc_data*>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long doub... | inline void
random_shuffle_unique(iteratorT begin,
iteratorT end,
random_engine& rng) noexcept
{
auto ret = begin++;
for (; begin != end; ++begin) {
if (ret->value != begin->value) {
std::shuffle(ret, begin, rng);
ret = begin;
}... | pushq %r15
pushq %r14
pushq %rbx
movq %rdx, %rbx
movq %rsi, %r14
leaq 0x20(%rdi), %r15
cmpq %r14, %r15
je 0x40e3e4
fldt (%rdi)
fldt (%r15)
addq $0x20, %r15
fxch %st(1)
fucompi %st(1), %st
fstp %st(0)
jne 0x40e3d0
jnp 0x40e3b8
addq $-0x20, %r15
movq %r15, %rsi
movq %rbx, %rdx
callq 0x40e965
movq %r15, %rdi
jmp 0x40e3b4
... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::maximize_tag, baryonyx::itm::quadratic_cost_type<long double>, true>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<std::pair<int, int> const*, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int>>>... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xb8, %rsp
movq %rcx, 0x68(%rsp)
movq %rdx, %rbx
movq %rsi, %r15
movq %rdi, %r12
leaq 0x3dc17(%rip), %rdx # 0x44f181
fldt 0x120(%rsp)
fstpt 0x74(%rsp)
fldt 0x110(%rsp)
fldt 0x100(%rsp)
fldt 0xf0(%rsp)
fstpt 0xa0(%rsp)
fstpt 0x90(%rsp)
fstpt 0x8... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, true>::select_variables(int, int, int) | int select_variables(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[i + ... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
fldz
cmpq %rsi, %r9
jge 0x42168d
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x421680
fldt (%rdi)
fucompi %st(1), %st
ja 0x42168d
addl 0x14(%rdi), %r8d
incq ... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, long double>::solve_inequality() | void solve_inequality()
{
lower_bound = compute_lower_bound();
upper_bound = compute_upper_bound();
make_init_node_0();
if (b_min <= nodes.back().sumfactor &&
nodes.back().sumfactor <= b_max) {
upper_bound = nodes.back().sumr;
subvector.copy(nodes... | pushq %rbx
flds 0x276c5(%rip) # 0x449960
movq %rdi, %rbx
fstpt 0x60(%rdi)
callq 0x422c42
movq %rbx, %rdi
fstpt 0x50(%rbx)
callq 0x422c78
movq 0x40(%rbx), %rax
movl 0x78(%rbx), %edx
movl -0x10(%rax), %ecx
cmpl %ecx, 0x74(%rbx)
setg %sil
cmpl %edx, %ecx
setg %dil
orb %sil, %dil
je 0x4222e3
cmpl %edx, %ecx
jle 0... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, long double>::make_init_node_0() | void make_init_node_0()
{
nodes.emplace_back(Float{ 0 }, 0, 0u);
nodes.back().variables = subvector.emplace();
nodes.back().z = items[1].sum_z;
subvector.fill(nodes.back().variables, 0);
} | pushq %rbx
subq $0x20, %rsp
fldz
fstpt 0x10(%rsp)
leaq 0xc(%rsp), %rdx
leaq 0x8(%rsp), %rcx
movq %rdi, %rbx
addq $0x38, %rdi
leaq 0x10(%rsp), %rsi
andl $0x0, (%rdx)
andl $0x0, (%rcx)
callq 0x422e8c
movq %rbx, %rdi
callq 0x362e68
movq 0x40(%rbx), %rcx
movl %eax, -0x40(%rcx)
movq 0x20(%rbx), %rdx
fldt 0x40(%rdx)
fstpt -0... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, true>::push_and_compute_update_row<baryonyx::bit_array, __gnu_cxx::__normal_iterator<int*, std::vector<int, std::allocator<int>>>>(baryonyx::bit_array&, __gnu_cxx::__normal_iterator<in... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0xa8, %rsp
movq %rcx, 0x58(%rsp)
movq %rsi, 0x48(%rsp)
movq %rdx, %r14
movq %rdi, %r12
leaq 0x293df(%rip), %rdx # 0x44f181
fldt 0x110(%rsp)
fstpt 0x64(%rsp)
fldt 0x100(%rsp)
fldt 0xf0(%rsp)
fldt 0xe0(%rsp)
fstpt 0x90(%rsp)
fstpt 0x80(%rsp)
fstp... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, true>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::none_observer>::operator()(std::vector<baryonyx::itm:... | result operator()(const std::vector<merged_constraint>& constraints,
int variables,
const Cost& original_costs,
double cost_constant)
{
result r;
bit_array x(variables);
int best_remaining = INT_MAX;
auto& p = m_ctx... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x2f8, %rsp # imm = 0x2F8
vmovsd %xmm0, 0x80(%rsp)
vxorpd %xmm0, %xmm0, %xmm0
movq %r8, %r13
movl %ecx, %ebx
movq %rdx, %r15
movq %rsi, %r14
movq %rdi, 0x58(%rsp)
vmovupd %zmm0, 0x58(%rdi)
vmovupd %zmm0, 0x40(%rdi)
vmovupd %zmm0, (%rdi)
... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, true>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::none_observer>::store_if_better(baryonyx::bit_array c... | 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 0x4290ae
pushq %r14
pushq %rbx
pushq %rax
movq %rdi, %r14
addq $0x20, %rdi
movq %rdx, %rbx
vmovsd %xmm0, (%rsp)
callq 0x28cba
movq %r14, %rdi
callq 0x429128
vmovsd (%rsp), %xmm1
vmovsd %xmm0, 0x38(%r14)
movq %rbx, 0x48(%r14)
andl $0x0, 0x50(%r14)
vmovsd %xmm1, 0x30(%r1... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
int baryonyx::itm::compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_... | int
compute_violated_constraints(const Solver& slv,
const Xtype& x,
std::vector<int>& out)
{
out.clear();
for (int k = 0; k != slv.m; ++k)
if (!is_valid_constraint(slv, k, x))
out.emplace_back(k);
return length(out);
} | pushq %r15
pushq %r14
pushq %r12
pushq %rbx
pushq %rax
movq (%rdx), %rax
movq %rdx, %rbx
movq %rsi, %r14
movq %rdi, %r15
cmpq %rax, 0x8(%rdx)
je 0x42a6ce
movq %rax, 0x8(%rbx)
leaq 0x4(%rsp), %r12
xorl %esi, %esi
movl %esi, 0x4(%rsp)
cmpl 0x180(%r15), %esi
je 0x42a704
movq %r15, %rdi
movq %r14, %rdx
callq 0x42a71b
testb... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::compute_order::infeasibility_local_compute_violated_constraints<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>, baryonyx::bit_array>(baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimiz... | int infeasibility_local_compute_violated_constraints(Solver& solver,
const Xtype& x)
{
m_order.clear();
for (int k = 0, e = solver.m; k != e; ++k) {
sparse_matrix<int>::const_row_iterator it, et;
std::tie(it, et) = sol... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x38, %rsp
movq 0x18(%rdi), %rax
movq %rdx, %r14
movq %rsi, %r15
cmpq %rax, 0x20(%rdi)
je 0x42ae98
movq %rax, 0x20(%rdi)
leaq 0x18(%rdi), %rax
leaq 0x10(%r15), %rcx
xorl %r12d, %r12d
movq %rdi, 0x20(%rsp)
movq %rax, 0x10(%rsp)
movl 0x180(%r15), %ea... | /quesnel[P]baryonyx/lib/src/itm-common.hpp |
int baryonyx::itm::branch_and_bound_solver<baryonyx::itm::minimize_tag, long double>::solve<std::unique_ptr<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>::rc_data [], std::default_delete<baryonyx::itm::solver_inequalities_Zcoeff... | int solve(R& reduced_cost, int r_size, int bk_min, int bk_max)
{
bx_assert(r_size >= 4);
bx_assert(bk_min <= bk_max);
b_min = bk_min;
b_max = bk_max;
items.resize(r_size);
if (!subvector.init(r_size))
throw solver_failure(solver_error_tag::no_solver_avai... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
pushq %rax
cmpl $0x3, %edx
jle 0x42b594
cmpl %r8d, %ecx
jg 0x42b5b5
leaq 0x20(%rdi), %r13
movl %ecx, 0x74(%rdi)
movl %edx, %ebx
movq %rsi, %r14
movl %edx, %r12d
movq %rdi, %r15
movl %r8d, 0x78(%rdi)
movq %r12, %rsi
movq %r13, %rdi
callq 0x42219a
movq %r1... | /quesnel[P]baryonyx/lib/src/branch-and-bound-solver.hpp |
baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>::select_variables(int, int, int) | int select_variables(const int r_size, int bkmin, int bkmax)
{
int sum = 0;
int best = -2;
for (int i = -1; i < r_size; ++i) {
if (bkmin <= sum && sum <= bkmax)
best = i;
if (best != -2 && i - 1 < r_size &&
stop_iterating<Mode>(R[i + ... | movq 0x60(%rdi), %rdi
movslq %esi, %rsi
pushq $-0x2
popq %rax
xorl %r8d, %r8d
pushq $-0x1
popq %r9
fldz
cmpq %rsi, %r9
jge 0x42b84d
cmpl %ecx, %r8d
movl %r9d, %r10d
cmovgl %eax, %r10d
cmpl %edx, %r8d
cmovgel %r10d, %eax
cmpl $-0x2, %eax
je 0x42b840
fldt (%rdi)
fucompi %st(1), %st
ja 0x42b84d
addl 0x14(%rdi), %r8d
incq ... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
bool baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>::push_and_compute_update_row<baryonyx::bit_array, std::reverse_iterator<__gnu_cxx::__normal_iterator<int const*, std::vector<int, std::allocator<int>>>>>(baryonyx::bit_array&, s... | bool push_and_compute_update_row(Xtype& x,
Iterator first,
Iterator last,
Float kappa,
Float delta,
Float theta,
... | pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x98, %rsp
movq %rcx, 0x68(%rsp)
movq %rsi, 0x48(%rsp)
leaq 0x10(%rdi), %rax
leaq 0x60(%rdi), %rcx
leaq 0x100(%rdi), %rsi
movq %rdx, %r14
movq %rdi, %r12
xorl %ebp, %ebp
fldt 0x100(%rsp)
fldt 0xf0(%rsp)
fstpt 0x8c(%rsp)
fldt 0xe0(%rsp)
fstpt 0x80(%... | /quesnel[P]baryonyx/lib/src/itm-solver-inequalities-Z.cpp |
baryonyx::itm::solver_functor<baryonyx::itm::solver_inequalities_Zcoeff<long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, false>, long double, baryonyx::itm::minimize_tag, baryonyx::itm::default_cost_type<long double>, baryonyx::none_observer>::is_timelimit_reached() | bool is_timelimit_reached()
{
m_end = std::chrono::steady_clock::now();
return is_time_limit(m_ctx.parameters.time_limit, m_begin, m_end);
} | pushq %rbx
movq %rdi, %rbx
callq 0x9540
movq %rax, 0x8(%rbx)
vxorpd %xmm2, %xmm2, %xmm2
movq 0x10(%rbx), %rcx
subq (%rbx), %rax
vmovsd (%rcx), %xmm0
vcvtsi2sd %rax, %xmm1, %xmm1
vdivsd 0x1abdb(%rip), %xmm1, %xmm1 # 0x44c8c0
vcmpnlepd %xmm2, %xmm0, %k1
vcmpltpd %xmm1, %xmm0, %k0 {%k1}
kmovd %k0, %eax
andb $0x1, %al
popq... | /quesnel[P]baryonyx/lib/src/itm-solver-common.hpp |
Subsets and Splits
SQL Console for LLM4Binary/decompile-bench
Filters out entries with file names ending in .cpp, providing a basic subset of the dataset that excludes C++ files.