/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/ |
H A D | internal_readwrite_2.f90 | 8 integer, parameter :: n1=2, n2=3, n3=5 variable in program:main 9 character(len=n1*n2*n3*2) :: line 10 character(len=2), dimension(n1,n2,n3):: c 11 write (unit=c(:,n2:1:-1,:),fmt="(I2)") (i,i=1,n1*n2*n3)
|
H A D | char_spread_1.f90 | 5 integer, parameter :: n1 = 3, n2 = 10, n3 = 4, slen = 9 variable in program:main 6 character (len = slen), dimension (n1, n3) :: a 9 do i3 = 1, n3 22 if (size (b, 3) .ne. n3) call abort 24 do i3 = 1, n3
|
H A D | realloc_on_assign_12.f90 | 18 INTEGER, PARAMETER :: n1=2, n2=2, n3=2 local in subroutine:unalloc 23 ALLOCATE (A(n1,n2*n3)) 28 DO m3=1,n3 38 B = RESHAPE(A, [n1,n2,n3]) 40 if (any (shape (B) /= [n1,n2,n3])) call abort () 41 if (any (ubound (B) /= [n1,n2,n3])) call abort () 45 DO m3=1,n3 58 INTEGER, PARAMETER :: n1=2, n2=2, n3=2 local in subroutine:wrong_shape 63 ALLOCATE (A(n1,n2*n3)) 68 DO m3=1,n3 [all...] |
H A D | char_eoshift_4.f90 | 5 integer, parameter :: n1 = 2, n2 = 5, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 7 character (len = slen), dimension (n1, n3) :: filler 8 integer (kind = 1), dimension (n1, n3) :: shift1 9 integer (kind = 2), dimension (n1, n3) :: shift2 10 integer (kind = 4), dimension (n1, n3) :: shift3 11 integer (kind = 8), dimension (n1, n3) :: shift4 23 do i3 = 1, n3 42 character (len = slen), dimension (n1, n2, n3) :: b 46 do i3 = 1, n3 [all...] |
H A D | char_eoshift_2.f90 | 5 integer, parameter :: n1 = 2, n2 = 5, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 8 integer (kind = 1), dimension (n1, n3) :: shift1 9 integer (kind = 2), dimension (n1, n3) :: shift2 10 integer (kind = 4), dimension (n1, n3) :: shift3 11 integer (kind = 8), dimension (n1, n3) :: shift4 20 do i3 = 1, n3 40 character (len = slen), dimension (n1, n2, n3) :: b 44 do i3 = 1, n3
|
H A D | char_cshift_2.f90 | 5 integer, parameter :: n1 = 2, n2 = 3, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 13 do i3 = 1, n3 33 character (len = slen), dimension (n1, n2, n3) :: b 36 do i3 = 1, n3
|
H A D | pr46804.f90 | 6 integer, parameter :: n1 = 2, n2 = 3, n3 = 4, slen = 3 variable in program:main 7 character (len = slen), dimension (n1, n2, n3) :: a 11 do i3 = 1, n3 26 character (len = slen), dimension (n1, n2, n3) :: b 27 do i3 = 1, n3
|
H A D | entry_6.f90 | 28 function n3 (d) function in module:foo 29 integer :: n3, d local in function:n3 30 n3 = n2(d) * n1(d) ! Check sibling references. 32 end function n3 47 if (n3(19) .ne. 200564019) call abort ()
|
H A D | char_cshift_1.f90 | 5 integer, parameter :: n1 = 2, n2 = 3, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 13 do i3 = 1, n3 27 character (len = slen), dimension (n1, n2, n3) :: b 30 do i3 = 1, n3 35 mod (d3 + i3 - 1, n3) + 1)) call abort
|
H A D | char_eoshift_1.f90 | 5 integer, parameter :: n1 = 6, n2 = 5, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 14 do i3 = 1, n3 34 character (len = slen), dimension (n1, n2, n3) :: b 38 do i3 = 1, n3 41 if (i1 + d1 .gt. n1 .or. i2 + d2 .gt. n2 .or. i3 + d3 .gt. n3) then
|
H A D | char_eoshift_3.f90 | 5 integer, parameter :: n1 = 2, n2 = 5, n3 = 4, slen = 3 variable in program:main 6 character (len = slen), dimension (n1, n2, n3) :: a 7 character (len = slen), dimension (n1, n3) :: filler 17 do i3 = 1, n3 36 character (len = slen), dimension (n1, n2, n3) :: b 40 do i3 = 1, n3
|
/haiku-buildtools/gcc/gcc/testsuite/c-c++-common/ |
H A D | Wunused-var-8.c | 15 char n3[M_STATIC]; local 18 return sizeof (n1) + sizeof (n2) + sizeof (n3) + sizeof (n4);
|
H A D | pr60101.c | 21 unsigned int n0, n1, n2, n3, n4, n5, n6, n7, n8, n9, n10, n11; local 28 for (n3 = 0; n3 < l; n3++) 40 += f[n0][n4][j][n8] * f[n1][n5][j][n9] * ~(f[n2][n6][w][n10]) * ~(f[n3][n7][w][n11]) 41 * (+0.25 * v[0][n2][0][i][n9][1] * v[0][n3][0][i][n5][1] * v[0][n10][0][i][n4][1] 43 + 0.25 * v[0][n2][0][i][n9][1] * v[0][n3][0][i][n5][1] * v[0][n10][0][i][n4][1] 45 - 0.5 * v[0][n2][0][i][n9][1] * v[0][n3][0][i][n5][1] * v[0][n10][0][i][n4][1] 47 + 0.25 * v[0][n2][0][i][n9][1] * v[0][n10][0][i][n5][1] * v[0][n3][0][i][n4][1] 49 - 0.5 * v[0][n2][0][i][n9][1] * v[0][n10][0][i][n5][1] * v[0][n3][ [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/compile/ |
H A D | pr37669.c | 11 int n1, n2, n3, n4, f5, f6; variable 25 chmap[(n3 >> 0) & 0x3f], chmap[(n3 >> 6) & 0x3f], 26 chmap[(n3 >> 12) & 0x3f], chmap[(n3 >> 18) & 0x3f], 27 chmap[(n3 >> 24) & 0x3f], chmap[(n3 >> 28) & 0x3f],
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/graphite/ |
H A D | isl-ast-gen-blocks-4.c | 5 foo (int k, int n1, int n2, int n3) argument 15 for (i = 0; i < n3; i++)
|
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/ |
H A D | amd64-abi-4.c | 9 void *n3 = (void *) &n2; variable 40 test (n1, n2, n3, n4); 43 assert (n3 == e3);
|
H A D | amd64-abi-7.c | 9 void *n3 = (void *) &n2; variable 40 test (n1, n2, n3, n4); 43 assert (n3 == e3);
|
H A D | amd64-abi-5.c | 9 double n3 = 39494.94; variable 51 test (n1, n2, n3, n4, n5, n6, n7, n8, n9, n10); 54 assert (n3 == e3);
|
H A D | amd64-abi-6.c | 9 double n3 = 39494.94; variable 58 test (n1, n2, n3, n4, n5, n6, n7, n8, n9, n10); 61 assert (n3 == e3);
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/array/tuple_interface/ |
H A D | get_debug_neg.cc | 29 int n3 = std::get<1>(ca); variable
|
H A D | get_neg.cc | 29 int n3 = std::get<1>(ca); variable
|
/haiku-buildtools/gcc/gmp/mpn/generic/ |
H A D | toom_interpolate_12pts.c | 190 mp_size_t n3; local 192 n3 = 3 * n; 193 n3p1 = n3 + 1; 195 #define r4 (pp + n3) /* 3n+1 */ 213 r4[n3] -= DO_mpn_sublsh_n (r4 + n, pp, 2 * n, 20, wsi); 224 r5[n3] -= DO_mpn_sublsh_n (r5 + n, pp, 2 * n, 10, wsi); 235 r3[n3] -= mpn_sub_n (r3+n, r3+n, pp, 2 * n); 245 if ((r4[n3] & (GMP_NUMB_MAX << (GMP_NUMB_BITS-3))) != 0) 246 r4[n3] |= (GMP_NUMB_MAX << (GMP_NUMB_BITS-2)); 307 cy = r5[n3] [all...] |
H A D | toom_interpolate_16pts.c | 277 mp_size_t n3; local 279 n3 = 3 * n; 280 n3p1 = n3 + 1; 282 #define r6 (pp + n3) /* 3n+1 */ 320 r5[n3] -= DO_mpn_sublsh_n (r5 + n, pp, 2 * n, 28, wsi); 331 r6[n3] -= DO_mpn_sublsh_n (r6 + n, pp, 2 * n, 14, wsi); 349 r7[n3] -= cy; 361 r4[n3] -= mpn_sub_n (r4+n, r4+n, pp, 2 * n); 383 if ((r5[n3] & (GMP_NUMB_MAX << (GMP_NUMB_BITS-7))) != 0) 384 r5[n3] | [all...] |
/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/coarray/ |
H A D | scalar_alloc_1.f90 | 5 integer :: n1, n2, n3 29 n3 = 3 30 allocate (B[n1:n2, n3:*]) 31 if (any (lcobound(b) /= [-1, 3]) .or. lcobound(B, dim=2) /= n3) & 46 if (any (lcobound(y) /= [-1, 3]) .or. lcobound(y, dim=2) /= n3) &
|
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/bitset/cons/ |
H A D | 1.cc | 49 const size_t n3 = 128; local 51 std::bitset<n3> bit03(str01, 5); 63 std::bitset<n3> bit03(str02, 0);
|