/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/lto/ |
H A D | pr41521_1.f90 | 1 subroutine atom(sol,k,eval) 2 real, intent(in) :: sol local in subroutine:atom 6 t1=sqrt(dble(k(1)**2)-(sol)**2) 7 eval(1)=sol**2/sqrt(t1)-sol**2
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | whole_file_31.f90 | 17 type(sysvector_t), target :: sol variable in program:t 18 solution => sol
|
H A D | dummy_procedure_7.f90 | 13 subroutine sol(cost) subroutine in module:t 61 call sol(cost)
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/algorithms/regex_match/ecma/char/ |
H A D | 58576.cc | 66 const char* sol[] = local 80 VERIFY(m.size() == sizeof(sol) / sizeof(*sol)); 83 VERIFY(s == sol[i]);
|
/haiku-buildtools/isl/ |
H A D | isl_lp_no_piplib.c | 15 struct isl_vec **sol) 12 isl_pip_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument
|
H A D | isl_lp_piplib.c | 17 isl_int *opt_denom, PipQuast *sol) 26 &sol->list->vector->the_vector[0], 1); 28 &sol->list->vector->the_deno[0], 1); 30 mpz_fdiv_q(*opt, sol->list->vector->the_vector[0], 31 sol->list->vector->the_deno[0]); 33 mpz_cdiv_q(*opt, sol->list->vector->the_vector[0], 34 sol->list->vector->the_deno[0]); 42 for (i = 0, list = sol->list->next; list; ++i, list = list->next) { 47 for (i = 0, list = sol->list->next; list; ++i, list = list->next) { 65 PipQuast *sol; local 16 copy_solution(struct isl_vec *vec, int maximize, isl_int *opt, isl_int *opt_denom, PipQuast *sol) argument [all...] |
H A D | isl_sample_piplib.c | 20 PipQuast *sol = NULL; local 38 sol = pip_solve(domain, NULL, -1, options); 39 if (!sol) 41 if (!sol->list) 50 for (i = 0, l = sol->list; l && i < dim; ++i, l = l->next) { 59 pip_quast_free(sol); 68 if (sol) 69 pip_quast_free(sol);
|
H A D | isl_lp.c | 25 struct isl_vec **sol) 37 if (res == isl_lp_ok && sol) { 38 *sol = isl_tab_get_sample_value(tab); 39 if (!*sol) 65 struct isl_vec **sol) 67 if (sol) 68 *sol = NULL; 75 return isl_pip_solve_lp(bmap, max, f, d, opt, opt_denom, sol); 77 return isl_tab_solve_lp(bmap, max, f, d, opt, opt_denom, sol); 86 struct isl_vec **sol) 22 isl_tab_solve_lp(struct isl_basic_map *bmap, int maximize, isl_int *f, isl_int denom, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument 62 isl_basic_map_solve_lp(struct isl_basic_map *bmap, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument 83 isl_basic_set_solve_lp(struct isl_basic_set *bset, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument 92 isl_map_solve_lp(__isl_keep isl_map *map, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument 201 isl_set_solve_lp(__isl_keep isl_set *set, int max, isl_int *f, isl_int d, isl_int *opt, isl_int *opt_denom, struct isl_vec **sol) argument [all...] |
H A D | isl_lp_piplib.h | 22 struct isl_vec **sol);
|
H A D | isl_tab_pip.c | 141 struct isl_sol *sol; member in struct:isl_sol_callback 168 void (*add)(struct isl_sol *sol, 170 void (*add_empty)(struct isl_sol *sol, struct isl_basic_set *bset); 171 void (*free)(struct isl_sol *sol); 175 static void sol_free(struct isl_sol *sol) argument 178 if (!sol) 180 for (partial = sol->partial; partial; partial = next) { 186 sol->free(sol); 192 static void sol_push_sol(struct isl_sol *sol, argument 221 sol_pop_one(struct isl_sol *sol) argument 237 sol_domain(struct isl_sol *sol) argument 287 sol_pop(struct isl_sol *sol) argument 350 sol_dec_level(struct isl_sol *sol) argument 375 sol_inc_level(struct isl_sol *sol) argument 448 sol_add(struct isl_sol *sol, struct isl_tab *tab) argument 538 struct isl_sol sol; member in struct:isl_sol_map 554 sol_map_free_wrap(struct isl_sol *sol) argument 563 sol_map_add_empty(struct isl_sol_map *sol, struct isl_basic_set *bset) argument 583 sol_map_add_empty_wrap(struct isl_sol *sol, struct isl_basic_set *bset) argument 603 sol_map_add(struct isl_sol_map *sol, struct isl_basic_set *dom, struct isl_mat *M) argument 683 sol_map_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) argument 3526 row_sign(struct isl_tab *tab, struct isl_sol *sol, int row) argument 3613 find_in_pos(struct isl_sol *sol, struct isl_tab *tab, isl_int *ineq) argument 3641 no_sol_in_strict(struct isl_sol *sol, struct isl_tab *tab, struct isl_vec *ineq) argument 3764 find_solutions(struct isl_sol *sol, struct isl_tab *tab) argument 3891 sol_has_mergeable_solutions(struct isl_sol *sol) argument 3922 find_solutions_main(struct isl_sol *sol, struct isl_tab *tab) argument 4083 struct isl_sol *sol = NULL; local 4128 struct isl_sol *sol; local 4742 struct isl_sol sol; member in struct:isl_sol_for 4755 sol_for_free_wrap(struct isl_sol *sol) argument 4771 sol_for_add(struct isl_sol_for *sol, struct isl_basic_set *dom, struct isl_mat *M) argument 4811 sol_for_add_wrap(struct isl_sol *sol, struct isl_basic_set *dom, struct isl_mat *M) argument 4967 is_optimal(__isl_keep isl_vec *sol, int n_op) argument 4984 force_better_solution(struct isl_tab *tab, __isl_keep isl_vec *sol, int n_op) argument 5077 isl_vec *sol = NULL; local 5201 isl_vec *sol; local 5223 struct isl_sol sol; member in struct:isl_sol_pma 5243 sol_pma_add_empty(struct isl_sol_pma *sol, __isl_take isl_basic_set *bset) argument 5267 sol_pma_add(struct isl_sol_pma *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) argument 5297 sol_pma_free_wrap(struct isl_sol *sol) argument 5302 sol_pma_add_empty_wrap(struct isl_sol *sol, __isl_take isl_basic_set *bset) argument 5308 sol_pma_add_wrap(struct isl_sol *sol, __isl_take isl_basic_set *dom, __isl_take isl_mat *M) argument 5374 struct isl_sol *sol; local [all...] |
H A D | polyhedron_minimize.c | 61 struct isl_vec *sol; local 78 res = isl_basic_set_solve_ilp(bset, 0, obj->el, &opt, &sol); 91 p = isl_printer_print_vec(p, sol); 99 isl_vec_free(sol);
|
H A D | isl_ilp.c | 82 struct isl_vec *sol; local 87 NULL, NULL, &sol); 90 return isl_vec_ceil(sol); 130 * Otherwise, return sol. 144 isl_int *f, isl_int *opt, struct isl_vec *sol, isl_int l, isl_int u) 165 isl_vec_free(sol); 166 sol = NULL; 170 isl_vec_free(sol); 171 sol = sample; 172 isl_seq_inner_product(f, sol 143 solve_ilp_search(struct isl_basic_set *bset, isl_int *f, isl_int *opt, struct isl_vec *sol, isl_int l, isl_int u) argument 208 struct isl_vec *sol; local [all...] |
H A D | isl_farkas.c | 361 isl_basic_set *sol; local 368 sol = isl_basic_set_universe(dim); 369 sol = isl_basic_set_set_rational(sol); 371 return sol; 374 sol = isl_basic_set_solutions(isl_basic_set_copy(set->p[0])); 380 sol = isl_basic_set_intersect(sol, sol_i); 384 return sol;
|
H A D | pip.c | 186 isl_set *sol; member in struct:isl_scan_pip 195 * represented by the pair (sol, empty). 199 * plugging in the value of the parameters in "sol". 219 isl_set *sol; local 222 sol = set_plug_in_parameters(isl_set_copy(sp->sol), sample); 223 assert(isl_set_is_equal(opt_set, sol)); 224 isl_set_free(sol); 237 isl_set *sol, isl_set *empty, int max) 260 sp.sol 236 check_solution(isl_basic_set *bset, isl_basic_set *context, isl_set *sol, isl_set *empty, int max) argument [all...] |
H A D | isl_map_piplib.c | 153 int *sol, int *nosol) 163 quast_count(q->next_else, maxnew, depth, maxdepth, sol, nosol); 164 quast_count(q->next_then, maxnew, depth, maxdepth, sol, nosol); 167 ++(*sol); 413 PipQuast *sol; local 441 sol = pip_solve(domain, context, -1, options); 443 if (sol) { 446 map = isl_map_from_quast(ctx, sol, 462 pip_quast_free(sol); 152 quast_count(PipQuast *q, int *maxnew, int depth, int *maxdepth, int *sol, int *nosol) argument
|
H A D | isl_schedule.c | 1485 isl_vec *sol; local 1498 sol = isl_tab_basic_set_non_trivial_lexmin(lp, 2, graph->n, 1500 return sol; 1514 * If check_zero is set, then the first two coordinates of sol are 1520 __isl_take isl_vec *sol, int use_cmap, int check_zero) 1526 if (!sol) 1528 if (sol->size == 0) 1529 isl_die(sol->ctx, isl_error_internal, 1532 isl_die(sol->ctx, isl_error_internal, 1536 zero = isl_int_is_zero(sol 1519 update_schedule(struct isl_sched_graph *graph, __isl_take isl_vec *sol, int use_cmap, int check_zero) argument 2557 is_trivial(struct isl_sched_node *node, __isl_keep isl_vec *sol) argument 2600 is_any_trivial(struct isl_sched_graph *graph, __isl_keep isl_vec *sol) argument 2631 isl_vec *sol; local 2771 isl_vec *sol; local [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/algorithms/regex_search/ |
H A D | 61424.cc | 36 string sol[] = { local 49 VERIFY(sol[i] == m[0]);
|
/haiku-buildtools/isl/include/isl/ |
H A D | lp.h | 34 struct isl_vec **sol); 38 struct isl_vec **sol); 42 struct isl_vec **sol); 46 struct isl_vec **sol);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/iterators/regex_iterator/wchar_t/ |
H A D | string_02.cc | 44 std::wstring sol[] = local 56 VERIFY(std::wstring((*p)[1].first, (*p)[1].second) == sol[i++]);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/28_regex/algorithms/regex_search/ecma/ |
H A D | assertion.cc | 55 string sol[] = local 76 VERIFY(s == sol[i++]);
|
/haiku-buildtools/gcc/gcc/ |
H A D | tree-ssa-structalias.c | 1632 bitmap sol = get_varinfo (lhs)->solution; local 1644 flag |= bitmap_set_bit (sol, anything_id); 1686 flag |= bitmap_ior_into (sol, get_varinfo (t)->solution); 1690 flag |= bitmap_set_bit (sol, escaped_id); 1693 flag |= bitmap_ior_into (sol, get_varinfo (t)->solution); 1708 get_varinfo (lhs)->solution = sol; 1720 bitmap sol = get_varinfo (rhs)->solution; local 1731 if (bitmap_bit_p (sol, anything_id)) 1732 sol = get_varinfo (find (anything_id))->solution; 1742 if (bitmap_ior_into (get_varinfo (t)->solution, sol)) 7564 struct pt_solution sol; local [all...] |
/haiku-buildtools/gcc/libgcc/config/ia64/ |
H A D | unwind-ia64.c | 2109 unw_word sol = (pfs >> 7) & 0x7f; 2111 ia64_rse_skip_regs ((unw_word *) context->bsp, -sol); 2101 unw_word sol = (pfs >> 7) & 0x7f; local
|