Searched refs:order (Results 1 - 25 of 277) sorted by relevance

1234567891011>>

/haiku-buildtools/gcc/gcc/testsuite/gfortran.dg/
H A Darray_constructor_6.f908 subroutine build (order)
9 integer :: order, i local in subroutine:build
11 call test (order, (/ (i * 2, i = 1, order) /))
16 subroutine test (order, values)
18 integer :: order, i local in subroutine:test
20 if (size (values, dim = 1) .ne. order) call abort
21 do i = 1, order
H A Darray_constructor_8.f908 subroutine build (order)
9 integer :: order, i local in subroutine:build
11 call test (order, 8, 5, (/ ((/ 1, 2, 3, 4, 5, 6, 7, 8 /), i = 1, order), &
14 call test (order, 2, 3, (/ ((/ 1, 2 /), i = 1, order), &
17 call test (order, 3, 5, (/ ((/ 1, 2, 3 /), i = 1, order), &
20 call test (order, 6, 1, (/ ((/ 1, 2, 3, 4, 5, 6 /), i = 1, order),
36 integer :: order local in subroutine:test
[all...]
H A Darray_constructor_10.f908 subroutine build (order)
9 integer :: order, i local in subroutine:build
11 call test (order, (/ (abs ((/ i, -i, -i * 2 /)), i = 1, order) /))
12 call test (order, abs ((/ ((/ -i, -i, i * 2 /), i = 1, order) /)))
13 call test (order, (/ abs ((/ ((/ i, i, -i * 2 /), i = 1, order) /)) /))
16 subroutine test (order, values)
18 integer :: order, local in subroutine:test
[all...]
H A Darray_constructor_9.f908 function gen (order)
10 integer :: order, i, j local in function:gen
12 allocate (gen (order, order + 1))
13 forall (i = 1 : order, j = 1 : order + 1) gen (i, j) = i * i + j
17 subroutine build (order)
18 integer :: order, i local in subroutine:build
20 call test (order, 0, (/ (gen (i), i = 1, order) /))
26 integer :: order local in subroutine:test
[all...]
H A Darray_constructor_7.f907 subroutine build (order)
8 integer :: order, i, j local in subroutine:build
10 call test (order, (/ (((j + 100) * i, j = 1, i), i = 1, order) /))
15 subroutine test (order, values)
17 integer :: order, i, j local in subroutine:test
19 if (size (values, dim = 1) .ne. order * (order + 1) / 2) call abort
20 do i = 1, order
H A Darray_constructor_11.f909 subroutine build (order)
10 integer :: order, i, j local in subroutine:build
20 call test (1, order, 3, (/ (i, i = 1, order, 3) /))
21 call test (order, 1, -3, (/ (i, i = order, 1, -3) /))
24 call test (1, 1000, 2, (/ (i, i = 1, 1000, 2), (i, i = order, 0, 1) /))
25 call test (1, 0, 3, (/ (i, i = 1, 0, 3), (i, i = order, 0, 1) /)) ! { dg-warning "will be executed zero times" }
26 call test (1, 2000, -5, (/ (i, i = 1, 2000, -5), (i, i = order, 0, 1) /)) ! { dg-warning "will be executed zero times" }
27 call test (3000, 99, 4, (/ (i, i = 3000, 99, 4), (i, i = order,
[all...]
H A Dnested_reshape.f9011 o = reshape(reshape(k, (/2,8/), order=(/2,1/)), (/8,2/))
H A Dreshape.f9018 a = reshape(b(1:12:2),shape(a),order=(/2,1/))
19 c = reshape(b(1:12:2),shape(a),order=(/2,1/))
24 ar = reshape(br(1:12:2),shape(a),order=(/2,1/))
28 write (line1,'(6F8.3)') reshape(b(1:12:2),shape(a),order=(/2,1/))
31 write (line3,'(6F8.3)') reshape(br(1:12:2),shape(ar),order=(/2,1/))
H A Dchar_reshape_1.f907 integer, dimension (3) :: shape, order variable in program:main
16 order = (/ 3, 1, 2 /)
17 call test (reshape (a, shape, pad, order))
H A Drealloc_on_assign_10.f9014 a = reshape (b, shape (a), order = [3, 2, 1])
/haiku-buildtools/gcc/libstdc++-v3/testsuite/23_containers/forward_list/operations/
H A D6.cc50 int order[][n] = { local
55 std::forward_list<int> sorted(order[0], order[0] + n);
57 for (unsigned int i = 0; i < sizeof(order)/sizeof(*order); ++i)
59 std::forward_list<int> head(order[i], order[i] + n);
66 std::forward_list<int> reversed(order[2], order[2] + n);
67 for (unsigned int i = 0; i < sizeof(order)/sizeo
[all...]
H A D7.cc35 int order[n] = {0,1,2,3,4,5,6,7,8,9,10,11,12}; local
37 std::forward_list<int> fl(order, order + n);
41 fl2.push_front(order[i]);
/haiku-buildtools/binutils/gas/testsuite/gas/mt/
H A Dbadorder.s1 ; Good operands in the wrong order should generate an error.
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/mt/
H A Dbadorder.s1 ; Good operands in the wrong order should generate an error.
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/vect/
H A Dpr55857-2.c4 unsigned order, int lp, int residual[])
8 if(order == 2)
3 foo(int *data, unsigned len, const int qlp_coeff[], unsigned order, int lp, int residual[]) argument
/haiku-buildtools/gcc/gcc/
H A Dggc-page.c84 (`order'), and satisfied from the appropriate page.
99 all full pages, with non-full pages arranged in order of decreasing
160 #define OBJECTS_IN_PAGE(P) ((P)->bytes / OBJECT_SIZE ((P)->order))
204 Ith extra order. Adding a new entry to this array is the *only*
250 /* The Ith entry is the number of objects on a page or order I. */
254 /* The Ith entry is the size of an object on a page of order I. */
309 unsigned char order;
713 debug_print_page_list (int order)
716 printf ("Head=%p, Tail=%p:\n", (void *) G.pages[order],
717 (void *) G.page_tails[order]);
307 unsigned char order; member in struct:page_entry
710 debug_print_page_list(int order) argument
791 alloc_page(unsigned order) argument
1236 size_t order, object_size; local
1274 size_t order, word, bit, object_offset, object_size; local
1606 size_t order = pe->order; local
1696 compute_inverse(unsigned order) argument
1722 unsigned order; local
1859 unsigned order; local
1942 unsigned order; local
2075 unsigned order; local
2367 unsigned order; local
2410 unsigned order; local
2439 unsigned order; local
[all...]
/haiku-buildtools/gcc/libstdc++-v3/include/ext/pb_ds/detail/tree_policy/
H A Dorder_statistics_imp.hpp44 find_by_order(size_type order) argument
54 if (order == o)
56 else if (order < o)
60 order -= o + 1;
71 find_by_order(size_type order) const
72 { return const_cast<PB_DS_CLASS_C_DEC*>(this)->find_by_order(order); }
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Dfunc8.go7 // Test evaluation order.
40 panic("wrong f,g order")
47 panic("wrong x,y order")
/haiku-buildtools/binutils/gas/testsuite/gas/arm/
H A Dattr-order.s2 @ are emitted in the proper order.
/haiku-buildtools/binutils/gas/testsuite/gas/bfin/
H A Dexpected_comparison_errors.l2 .*:1: Error: AREGs are in bad order or same. Input text was A0.
3 .*:2: Error: AREGs are in bad order or same. Input text was A1.
4 .*:3: Error: AREGs are in bad order or same. Input text was A0.
5 .*:4: Error: AREGs are in bad order or same. Input text was a0.
6 .*:5: Error: AREGs are in bad order or same. Input text was a1.
7 .*:6: Error: AREGs are in bad order or same. Input text was a0.
8 .*:7: Error: AREGs are in bad order or same. Input text was a0.
9 .*:8: Error: AREGs are in bad order or same. Input text was a1.
10 .*:9: Error: AREGs are in bad order or same. Input text was a0.
/haiku-buildtools/binutils/ld/testsuite/ld-mips-elf/
H A Deh-frame5.d6 # The order of the relocations doesn't really matter, but they must
/haiku-buildtools/binutils/gas/testsuite/gas/mmix/
H A Dexpr-1.s2 % the known expression evaluation order mismatch problem.
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/mmix/
H A Dexpr-1.s2 % the known expression evaluation order mismatch problem.
/haiku-buildtools/isl/
H A Disl_tarjan.h6 * index represents the order in which nodes are visited.
23 * order contains the elements of the components separated by -1
24 * op represents the current position in order
32 int *order; member in struct:isl_tarjan_graph
/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/
H A Dpr64935-2.c7 unsigned order, int lp, int residual[], int i)
6 foo(int *data, unsigned len, const int qlp_coeff[], unsigned order, int lp, int residual[], int i) argument

Completed in 149 milliseconds

1234567891011>>