/haiku-buildtools/gcc/gcc/testsuite/gcc.target/powerpc/ |
H A D | pr53487.c | 18 int row, col; local 22 for (row = 0; row < Np; row++) 23 for (col = row+1; col < Np; col++) 24 if (mx[row][col] < min) 25 i = row;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/ |
H A D | webizer.c | 16 int row = 1; variable 25 for( row = 1 ; row <= numRows ; row++ ) { 27 if( rowArray[row].endx1 > 0 ) {
|
/haiku-buildtools/isl/ |
H A D | isl_mat.c | 33 mat->row = NULL; 37 mat->row = isl_alloc_array(ctx, isl_int *, n_row); 38 if (n_row && !mat->row) 42 mat->row[i] = mat->block.data + i * n_col; 64 isl_int **row; local 84 isl_seq_cpy(new_mat->row[i], mat->row[i], mat->n_col); 97 row = isl_realloc_array(mat->ctx, mat->row, isl_int *, n_row); 98 if (n_row && !row) 116 isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row, unsigned first_row, unsigned n_row, unsigned first_col, unsigned n_col) argument 235 isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v) argument 251 isl_mat_get_element_val(__isl_keep isl_mat *mat, int row, int col) argument 268 isl_mat_set_element(__isl_take isl_mat *mat, int row, int col, isl_int v) argument 287 isl_mat_set_element_si(__isl_take isl_mat *mat, int row, int col, int v) argument 308 isl_mat_set_element_val(__isl_take isl_mat *mat, int row, int col, __isl_take isl_val *v) argument 481 exchange(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned i, unsigned j) argument 495 subtract(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned i, unsigned j, isl_int m) argument 511 oppose(struct isl_mat *M, struct isl_mat **U, struct isl_mat **Q, unsigned row, unsigned col) argument 541 int row, col; local 703 row_first_non_zero(isl_int **row, unsigned n_row, unsigned col) argument 713 row_abs_min_non_zero(isl_int **row, unsigned n_row, unsigned col) argument 734 inv_oppose( struct isl_mat *left, struct isl_mat *right, unsigned row) argument 741 inv_subtract(struct isl_mat *left, struct isl_mat *right, unsigned row, unsigned i, isl_int m) argument 758 int row; local 871 int row; local 1305 isl_mat_drop_rows(struct isl_mat *mat, unsigned row, unsigned n) argument 1370 isl_mat_insert_rows(__isl_take isl_mat *mat, unsigned row, unsigned n) argument 1403 isl_mat_insert_zero_rows(__isl_take isl_mat *mat, unsigned row, unsigned n) argument 1455 isl_mat_unimodular_complete(struct isl_mat *M, int row) argument 1639 isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, isl_int m) argument 1669 isl_mat_normalize_row(__isl_take isl_mat *mat, int row) argument [all...] |
H A D | basis_reduction_tab.c | 17 struct isl_vec *row; member in struct:tab_lp 34 static void set_lp_obj(struct tab_lp *lp, isl_int *row, int dim); 38 static int add_lp_row(struct tab_lp *lp, isl_int *row, int dim); 39 static void get_alpha(struct tab_lp* lp, int row, mpq_t *alpha); 41 static int cut_lp_to_hyperplane(struct tab_lp *lp, isl_int *row); 60 #define GBR_lp_add_row(lp, row, dim) add_lp_row(lp, row, dim) 61 #define GBR_lp_get_alpha(lp, row, alpha) get_alpha(lp, row, alpha) 71 static struct isl_tab *gbr_tab(struct isl_tab *tab, struct isl_vec *row) argument 127 set_lp_obj(struct tab_lp *lp, isl_int *row, int dim) argument 170 cut_lp_to_hyperplane(struct tab_lp *lp, isl_int *row) argument 218 add_lp_row(struct tab_lp *lp, isl_int *row, int dim) argument 232 get_alpha(struct tab_lp* lp, int row, mpq_t *alpha) argument [all...] |
H A D | isl_tab.c | 314 * row{1,2} is the number of rows in tableau {1,2} 340 isl_seq_cpy(prod->row[n + i], mat1->row[i], off + d1); 341 isl_seq_clr(prod->row[n + i] + off + d1, d2); 342 isl_seq_cpy(prod->row[n + i] + off + d1 + d2, 343 mat1->row[i] + off + d1, col1 - d1); 344 isl_seq_clr(prod->row[n + i] + off + col1 + d1, col2 - d2); 349 isl_seq_cpy(prod->row[n + i], mat2->row[i], off); 350 isl_seq_clr(prod->row[ 706 find_pivot(struct isl_tab *tab, struct isl_tab_var *var, struct isl_tab_var *skip_var, int sgn, int *row, int *col) argument 743 isl_tab_row_is_redundant(struct isl_tab *tab, int row) argument 946 isl_tab_mark_redundant(struct isl_tab *tab, int row) argument 1018 update_row_sign(struct isl_tab *tab, int row, int col, int row_sgn) argument 1099 isl_tab_pivot(struct isl_tab *tab, int row, int col) argument 1240 int row, col; local 1272 row_is_neg(struct isl_tab *tab, int row) argument 1283 row_sgn(struct isl_tab *tab, int row) argument 1300 int row, col; local 1321 int row, col; local 1354 int row, col; local 1406 row_at_most_neg_one(struct isl_tab *tab, int row) argument 1429 int row, col; local 1488 int row, col; local 1552 row_is_manifestly_non_integral(struct isl_tab *tab, int row) argument 1712 isl_int *row; local 1756 drop_row(struct isl_tab *tab, int row) argument 1837 int row, col; local 1896 row_is_manifestly_zero(struct isl_tab *tab, int row) argument 1948 isl_int *row; local 1969 int row; local 2360 int row; local 2385 int row = tab->var[i].index; local 2411 int row; local 2485 isl_int *row; local 2639 may_be_equality(struct isl_tab *tab, int row) argument 2929 int row; local 2978 int row, col; local 3181 int row; local 3311 separation_type(struct isl_tab *tab, unsigned row) argument 3355 int row; local [all...] |
H A D | isl_equalities.c | 79 isl_int_set_si(C->row[0][0], 1); 81 isl_seq_clr(M->row[i], B->n_row); 82 isl_int_set(M->row[i][i], d->block.data[i]); 83 isl_int_neg(C->row[1 + i][0], B->row[i][0]); 84 isl_int_fdiv_r(C->row[1+i][0], C->row[1+i][0], M->row[i][i]); 86 isl_int_fdiv_r(M->row[i][B->n_row + j], 87 B->row[ [all...] |
H A D | isl_tab_pip.c | 32 * in a row that increases the constant term of the row holding the 35 * Here, we always pivot in the row holding the constraint, 95 /* return row index of "best" split */ 268 if (isl_seq_first_non_zero(s1->M->row[i]+1+dim+n_div, 271 if (isl_seq_first_non_zero(s2->M->row[i]+1+dim+n_div, 274 if (!isl_seq_eq(s1->M->row[i], s2->M->row[i], 1+dim+n_div)) 396 isl_seq_scale(mat->row[i], mat->row[ 453 int row; local 697 get_row_parameter_line(struct isl_tab *tab, int row, isl_int *line) argument 760 get_row_parameter_ineq(struct isl_tab *tab, int row) argument 809 get_row_parameter_div(struct isl_tab *tab, int row) argument 837 get_row_split_div(struct isl_tab *tab, int row) argument 897 set_row_cst_to_div(struct isl_tab *tab, int row, int div) argument 934 is_obviously_neg(struct isl_tab *tab, int row) argument 983 is_obviously_nonneg(struct isl_tab *tab, int row) argument 1040 lexmin_col_pair(struct isl_tab *tab, int row, int col1, int col2, isl_int tmp) argument 1089 lexmin_pivot_col(struct isl_tab *tab, int row) argument 1132 int row; local 1170 int row; local 1210 report_conflict(struct isl_tab *tab, int row) argument 1250 int row, col; local 1294 last_var_col_or_int_par_col(struct isl_tab *tab, int row) argument 1364 is_constant(struct isl_tab *tab, int row) argument 1385 int row; local 1496 integer_parameter(struct isl_tab *tab, int row) argument 1524 integer_variable(struct isl_tab *tab, int row) argument 1543 integer_constant(struct isl_tab *tab, int row) argument 1570 int row; local 1627 add_cut(struct isl_tab *tab, int row) argument 1682 int row; local 1764 int row; local 1966 add_parametric_cut(struct isl_tab *tab, int row, struct isl_context *context) argument 2157 int row; local 3429 is_critical(struct isl_tab *tab, int row) argument 3526 row_sign(struct isl_tab *tab, struct isl_sol *sol, int row) argument 3781 int row; local 3924 int row; local 4161 isl_int **row = (isl_int **)entry; local [all...] |
H A D | basis_reduction_templ.c | 30 * The first tab->n_zero rows of the basis (ignoring the constant row) 57 int row; local 133 GBR_lp_set_obj(lp, B->row[1+i]+1, dim); 141 empty = GBR_lp_cut(lp, B->row[1+i]+1); 151 GBR_lp_set_obj(lp, B->row[1+i+1]+1, dim); 160 row = GBR_lp_next_row(lp); 165 row = GBR_lp_add_row(lp, B->row[1+i]+1, dim); 166 GBR_lp_set_obj(lp, B->row[1+i+1]+1, dim); 173 GBR_lp_get_alpha(lp, row, [all...] |
H A D | isl_mat_private.h | 14 isl_int **row; member in struct:isl_mat 24 __isl_give isl_mat *isl_mat_sub_alloc6(isl_ctx *ctx, isl_int **row,
|
H A D | isl_local_space.c | 219 if (isl_int_is_zero(ls->div->row[pos][0])) 229 isl_seq_cpy(aff->v->el, ls->div->row[pos], aff->v->size); 306 isl_seq_cpy(mat->row[i], div->row[i], 2); 307 isl_seq_clr(mat->row[i] + 2, mat->n_col - 2); 309 isl_int_set(mat->row[i][2 + r->pos[j]], 310 div->row[i][2 + j]); 363 isl_seq_cpy(ls->div->row[ls->div->n_row - 1], div->el, div->size); 364 isl_int_set_si(ls->div->row[ls->div->n_row - 1][div->size], 0); 391 /* Copy row " [all...] |
H A D | isl_sample.c | 127 isl_int_set_si(bounds->row[0][0], 1); 128 isl_seq_clr(bounds->row[0]+1, dim); 139 isl_seq_cpy(dirs->row[0], bset->ineq[0]+1, dirs->n_col); 140 isl_seq_cpy(bounds->row[1], bset->ineq[0], bounds->n_col); 144 isl_seq_cpy(dirs->row[n], bset->ineq[j]+1, dirs->n_col); 146 pos = isl_seq_first_non_zero(dirs->row[n], dirs->n_col); 151 pos_i = isl_seq_first_non_zero(dirs->row[i], dirs->n_col); 156 isl_seq_elim(dirs->row[n], dirs->row[i], pos, 158 pos = isl_seq_first_non_zero(dirs->row[ 1149 struct isl_vec *row = NULL; local [all...] |
H A D | isl_affine_hull.c | 82 /* Make eq[row][col] of both bmaps equal so we can add the row 84 * Note that because of the echelon form, the columns of row row 89 unsigned row, unsigned col) 93 if (isl_int_eq(bset1->eq[row][col], bset2->eq[row][col])) 98 isl_int_lcm(m, bset1->eq[row][col], bset2->eq[row][col]); 99 isl_int_divexact(c, m, bset1->eq[row][co 87 set_common_multiple( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) argument 109 delete_row(struct isl_basic_set *bset, unsigned row) argument 130 construct_column( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) argument 166 transform_column( struct isl_basic_set *bset1, struct isl_basic_set *bset2, unsigned row, unsigned col) argument 213 int row; local [all...] |
H A D | isl_scan.c | 149 res = isl_tab_min(tab, B->row[1 + level], 155 isl_seq_neg(B->row[1 + level] + 1, 156 B->row[1 + level] + 1, dim); 157 res = isl_tab_min(tab, B->row[1 + level], 159 isl_seq_neg(B->row[1 + level] + 1, 160 B->row[1 + level] + 1, dim); 189 isl_int_neg(B->row[1 + level][0], min->el[level]); 190 if (isl_tab_add_valid_eq(tab, B->row[1 + level]) < 0) 192 isl_int_set_si(B->row[1 + level][0], 0);
|
H A D | isl_polynomial.c | 1217 li = isl_seq_last_non_zero(div->row[i], div->n_col); 1218 lj = isl_seq_last_non_zero(div->row[j], div->n_col); 1223 return isl_seq_cmp(div->row[i], div->row[j], div->n_col); 1228 int row; member in struct:isl_div_sort_info 1237 return cmp_row(i1->div, i1->row, i2->row); 1270 array[i].row = i; 1282 if (pos[array[i].row] == i) 1284 qp->div = isl_mat_swap_rows(qp->div, i, pos[array[i].row]); 2166 needs_invert(__isl_keep isl_mat *div, int row) argument 4701 isl_int *row = qp->div->row[i]; local [all...] |
H A D | isl_morph.c | 283 isl_seq_clr(mat->row[1 + i], mat->n_col); 284 isl_int_set(mat->row[1 + i][1 + i], mat->row[0][0]); 413 isl_int_set_si(C->row[0][0], 1); 414 isl_seq_clr(C->row[0] + 1, otype - 1); 415 isl_mat_sub_neg(C->ctx, C->row + 1, bset->eq + f_eq, n_eq, 0, 0, otype); 423 if (!isl_int_is_one(C->row[0][0])) { 429 isl_seq_gcd(C->row[1 + i] + 1, otype - 1, &g); 430 isl_int_gcd(g, g, C->row[0][0]); 431 if (!isl_int_is_divisible_by(C->row[ [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | pr54245.c | 11 void idct_row(short *row, int *dst) argument 15 a0 = W1 * row[0]; 18 a0 += W2 * row[2]; 19 a1 += W6 * row[2]; 21 b0 = W1 * row[1]; 22 b1 = W3 * row[1];
|
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/torture/ |
H A D | pr54647.C | 15 Row *row; member in struct:B::C 19 B::Row & b = *a.row;
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/ |
H A D | pr39339.c | 36 long row, col; member in struct:E 41 void foo (struct E *screen, unsigned int c, int columns, struct B *row) argument 49 row->cells->data[col].c = c; 50 row->cells->data[col].attr = attr; 55 row->cells->data[col].c = c; 56 row->cells->data[col].attr = attr; 64 struct E e = {.row = 5,.col = 0,.defaults =
|
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | pr61960.f90 | 13 function get_row(this, i) result(row) 17 real(kind=sp), dimension(this%nr_cols) :: row local in function:get_row 18 row = this%data(:, i)
|
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/ |
H A D | code-gen5.C | 58 int row; /* Row element refers to */ member in class:VecElem 75 int row() const { return 19; } function in class:Vector 108 Vector( int row ) 110 assert( row > 0 ); 112 r = new VectorInt( row ); 118 Vector( int row, double *d, int beg ) argument 120 assert( row > 0 ); 122 r = new VectorInt( row, d, beg ); 144 operator()( int row ) const 165 if( rownum > row() || rownu [all...] |
/haiku-buildtools/gcc/libstdc++-v3/testsuite/performance/23_containers/insert/ |
H A D | unordered_map_array.cc | 43 map_type& row = matrix[i / 4]; local 44 ++row[j / 4];
|
/haiku-buildtools/isl/include/isl/ |
H A D | mat.h | 42 int isl_mat_get_element(__isl_keep isl_mat *mat, int row, int col, isl_int *v); 44 int row, int col); 46 int row, int col, isl_int v); 48 int row, int col, int v); 50 int row, int col, __isl_take isl_val *v); 74 __isl_give isl_mat *isl_mat_scale_down_row(__isl_take isl_mat *mat, int row, 78 __isl_give isl_mat *isl_mat_normalize_row(__isl_take isl_mat *mat, int row); 83 unsigned row, unsigned n); 87 unsigned row, unsigned n); 95 unsigned row, unsigne [all...] |
/haiku-buildtools/cloog/osl/source/ |
H A D | relation.c | 409 * stored at the "row"^th row of the relation pointed by "relation" between 412 * \param[in] row The row corresponding to the expression. 421 int row, int start, int stop, int oppose, 434 relation->m[row], i, relation->m[row], i); 443 osl_int_address(relation->precision, relation->m[row], i), 448 relation->m[row], i, relation->m[row], 420 osl_relation_subexpression(osl_relation_p relation, int row, int start, int stop, int oppose, char ** strings) argument 467 osl_relation_expression(osl_relation_p relation, int row, char ** strings) argument 488 osl_relation_is_simple_output(osl_relation_p relation, int row) argument 541 osl_relation_sprint_comment(osl_relation_p relation, int row, char ** strings, char ** arrays) argument 1305 osl_relation_replace_vector(osl_relation_p relation, osl_vector_p vector, int row) argument 1329 osl_relation_add_vector(osl_relation_p relation, osl_vector_p vector, int row) argument 1357 osl_relation_sub_vector(osl_relation_p relation, osl_vector_p vector, int row) argument 1389 osl_relation_insert_vector(osl_relation_p relation, osl_vector_p vector, int row) argument 1428 osl_relation_insert_blank_row(osl_relation_p relation, int row) argument 1509 osl_relation_replace_constraints(osl_relation_p r1, osl_relation_p r2, int row) argument 1537 osl_relation_insert_constraints(osl_relation_p r1, osl_relation_p r2, int row) argument 1585 osl_relation_remove_row(osl_relation_p r, int row) argument [all...] |
/haiku-buildtools/gcc/gcc/ |
H A D | modulo-sched.c | 164 /* The next/prev PS_INSN in the same row. */ 197 instructions that are scheduled for that row. */ 203 /* rows[i] points to linked list of insns scheduled in row i (0<=i<ii). */ 210 /* rows_length[i] holds the number of instructions in the row. 212 trying to schedule a node in a full row; that is, to avoid running 264 #define SCHED_ROW(x) (SCHED_PARAMS (x)->row) 273 int row; /* Holds time % ii. */ 276 /* The column of a node inside the ps. If nodes u, v are on the same row, 494 /* Update the sched_params (time, row and stage) for node U using the II, 543 /* Set SCHED_COLUMN for each instruction in row RO 271 int row; /* Holds time % ii. */ member in struct:node_sched_params 542 set_columns_for_row(partial_schedule_ptr ps, int row) argument 556 int row; local 874 int row; local 913 int row; local 1023 int row = SMODULO (branch_cycle, ps->ii); local 1138 int row; local 2322 int row; local 2459 int row; local 3003 int row; local 3041 int row; local 3130 int row; local 3177 int row = SMODULO (cycle, ps->ii); local 3334 int i, row, backward_rotates; local [all...] |
/haiku-buildtools/gcc/libgcc/ |
H A D | siditi-object.mk | 1 # This file is included several times in a row, once for each element of
|