Home
last modified time | relevance | path

Searched refs:rows_to_process (Results 1 – 10 of 10) sorted by relevance

/dports/graphics/colord/colord-1.3.5/lib/colord/
H A Dcd-transform.c586 guint rows_to_process; member
600 for (i = 0; i < job->rows_to_process; i++) { in cd_transform_process_func()
679 guint rows_to_process; in cd_transform_process() local
749 rows_to_process = height / priv->max_threads; in cd_transform_process()
750 for (i = 0; i < height; i += rows_to_process) { in cd_transform_process()
756 if (i + rows_to_process > height) in cd_transform_process()
757 job->rows_to_process = height - i; in cd_transform_process()
759 job->rows_to_process = rows_to_process; in cd_transform_process()
763 p_in += rowstride * rows_to_process * priv->bpp_input; in cd_transform_process()
764 p_out += rowstride * rows_to_process * priv->bpp_output; in cd_transform_process()
/dports/math/yices/yices-2.6.2/src/solvers/simplex/
H A Dsimplex_propagator1.h1034 assert(solver->rows_to_process.size == 0); in collect_relevant_prop_rows()
1038 ivector_push(&solver->rows_to_process, r); in collect_relevant_prop_rows()
1058 to_process = &solver->rows_to_process; in collect_prop_rows_for_variable()
1091 assert(solver->rows_to_process.size == 0); in collect_relevant_prop_rows()
1095 ivector_push(&solver->rows_to_process, r); in collect_relevant_prop_rows()
1138 v = &solver->rows_to_process; in visit_candidate_rows()
H A Ddiophantine_systems.c726 init_generic_heap(&solver->rows_to_process, 0, 0, (heap_cmp_fun_t) active_rows_compare, solver); in init_dsolver()
799 reset_generic_heap(&solver->rows_to_process); in reset_dsolver()
899 delete_generic_heap(&solver->rows_to_process); in delete_dsolver()
1755 assert(generic_heap_is_empty(&solver->rows_to_process)); in dsolver_rosser_init()
1773 generic_heap_add(&solver->rows_to_process, i); in dsolver_rosser_init()
1778 n = generic_heap_nelems(&solver->rows_to_process); in dsolver_rosser_init()
1836 if (generic_heap_member(&solver->rows_to_process, k)) { in dsolver_activate_column()
1837 generic_heap_remove(&solver->rows_to_process, k); in dsolver_activate_column()
1861 generic_heap_add(&solver->rows_to_process, v->data[i]); in dsolver_restore_rows_to_process()
2165 to_process = &solver->rows_to_process; in dsolver_is_feasible()
H A Ddiophantine_systems.h404 generic_heap_t rows_to_process; // rows sorted in increasing row-count order member
H A Dsimplex_propagator0.h88 to_process = &solver->rows_to_process; in collect_prop_rows_for_variable()
125 assert(solver->rows_to_process.size == 0); in collect_relevant_prop_rows()
129 ivector_push(&solver->rows_to_process, r); in collect_relevant_prop_rows()
1441 v = &solver->rows_to_process; in check_all_propagation_rows()
H A Ddsolver_printer.c509 n = generic_heap_nelems(&solver->rows_to_process); in dsolver_print_rows_to_process()
510 h = solver->rows_to_process.heap; in dsolver_print_rows_to_process()
H A Dsimplex_types.h839 ivector_t rows_to_process; // rows for propagation member
H A Dsimplex.c1642 init_ivector(&solver->rows_to_process, DEF_PROCESS_ROW_VECTOR_SIZE); in init_simplex_solver()
10632 ivector_reset(&solver->rows_to_process); in simplex_reset()
10870 delete_ivector(&solver->rows_to_process); in delete_simplex_solver()
/dports/math/viennacl/ViennaCL-1.7.1/viennacl/linalg/cuda/
H A Diterative_operations.hpp204 unsigned int rows_to_process = row_stop - row_start; in pipelined_cg_csr_vec_mul_adaptive_kernel() local
206 if (rows_to_process > 1) // CSR stream with one thread per row in pipelined_cg_csr_vec_mul_adaptive_kernel()
998 unsigned int rows_to_process = row_stop - row_start; in pipelined_cg_prod() local
1000 if (rows_to_process > 1) // CSR stream with one thread per row in pipelined_cg_prod()
H A Dsparse_matrix_operations.hpp206 unsigned int rows_to_process = row_stop - row_start; in compressed_matrix_vec_mul_adaptive_kernel() local
208 if (rows_to_process > 1) // CSR stream with one thread per row in compressed_matrix_vec_mul_adaptive_kernel()