Searched refs:rows (Results 1 - 11 of 11) sorted by relevance

/haiku-buildtools/gcc/libgomp/testsuite/libgomp.fortran/examples-4/
H A De.51.3.f905 subroutine init (Q, rows, cols)
6 integer :: i, k, rows, cols local in subroutine:init
7 double precision :: Q(rows,cols)
9 do i = 1, rows
15 subroutine check (P, Q, rows, cols)
16 integer :: i, k, rows, cols local in subroutine:check
18 double precision :: P(rows,cols), Q(rows,cols), diff
20 do i = 1, rows
27 subroutine gramSchmidt_ref (Q, rows, col
28 integer :: i, k, rows local in subroutine:gramSchmidt_ref
43 integer :: i, k, rows local in subroutine:gramSchmidt
68 integer :: cols, rows variable in program:e_51_3
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/aarch64/
H A Dpr62040.c11 int32x4x4_t rows; local
14 row01.val[0] = vreinterpretq_u64_s32 (rows.val[0]);
15 row01.val[1] = vreinterpretq_u64_s32 (rows.val[1]);
/haiku-buildtools/gcc/libgomp/testsuite/libgomp.c/examples-4/
H A De.51.3.c8 void init (int Q[][COLS], const int rows, const int cols) argument
11 for (i = 0; i < rows; i++)
16 void check (int a[][COLS], int b[][COLS], const int rows, const int cols) argument
19 for (i = 0; i < rows; i++)
25 void gramSchmidt_ref (int Q[][COLS], const int rows, const int cols) argument
33 for (i = 0; i < rows; i++)
36 for (i = 0; i < rows; i++)
41 void gramSchmidt (int Q[][COLS], const int rows, const int cols) argument
45 #pragma omp target data map(Q[0:rows][0:cols]) map(to:COLS)
52 for (i = 0; i < rows;
[all...]
/haiku-buildtools/gcc/gcc/testsuite/g++.old-deja/g++.law/
H A Doperators32.C10 void ffree(long rows, T** array) argument
12 for( long i = 0; i < rows; i++ )
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/
H A Dpr38498.c3 double test_vector (float **data, int rows, int cols, int vqrows,double epsilon, int maxiter,int **mean, int *map) argument
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/
H A Dpr70098.C27 long rows() { function in class:D
37 long rows() { function in class:PlainObjectBase
38 return m_storage.rows();
89 long size = m.rows();
/haiku-buildtools/gcc/gcc/testsuite/g++.dg/tree-ssa/
H A Divopts-3.C48 MinimalVec3 * rows[9]; local
50 rows[i] = new MinimalVec3[wcub];
65 res[i*wsqr + k*w + m] += img[( i + j - 1 ) *wsqr + ( k + l - 1 ) *w + m + n - 1] * rows[j*3 + l][i*wsqr + k*w + m][n];
/haiku-buildtools/gcc/gcc/
H A Dmodulo-sched.c195 /* Holds the partial schedule as an array of II rows. Each entry of the
200 int ii; /* Number of rows in the partial schedule. */
203 /* rows[i] points to linked list of insns scheduled in row i (0<=i<ii). */ member in struct:partial_schedule
204 ps_insn_ptr *rows;
551 for (cur_insn = ps->rows[row]; cur_insn; cur_insn = cur_insn->next_in_row)
882 for (crr_insn = ps->rows[row]; crr_insn; crr_insn = crr_insn->next_in_row)
920 for (ps_ij = ps->rows[row]; ps_ij; ps_ij = ps_ij->next_in_row)
1079 for (next_ps_i = ps->rows[row];
1145 for (ps_ij = ps->rows[row]; ps_ij; ps_ij = ps_ij->next_in_row)
2064 The first and last rows ar
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/
H A D980408-1.c31 rows, member in struct:_Image
/haiku-buildtools/gcc/gcc/ada/
H A Dterminals.c135 int rows ATTRIBUTE_UNUSED,
1051 __gnat_setup_winsize (void *desc, int rows, int columns) argument
1352 void __gnat_setup_winsize (pty_desc *desc, int rows, int columns) { argument
1355 s.ws_row = (unsigned short)rows;
/haiku-buildtools/isl/doc/
H A Dimplementation.tex201 \end{pmatrix}$ and expresses the constraints $\vec y$ in the rows in terms
211 rows corresponding to constraints are all non-negative.
228 is (implicitly) extended with extra rows defining the original
249 Note that there is no need to store the extra rows explicitly.
412 $a_j \ne 0$, then the (implicit) top rows of the initial tableau
587 Recall that if there are no rows with a non-positive constant term,
588 but there are rows with an indeterminate sign, then the context
589 needs to be split along the constant term of one of these rows.
594 than those of the other rows.
598 rows a
[all...]

Completed in 248 milliseconds