Searched refs:gt (Results 1 - 25 of 379) sorted by relevance

1234567891011>>

/haiku-buildtools/binutils/gas/testsuite/gas/arc/
H A Dflag.s18 flag.gt 1
19 flag.gt 2
20 flag.gt 4
21 flag.gt 8
22 flag.gt 16
23 flag.gt 32
24 flag.gt 64
25 flag.gt 128
H A Dflag.d18 0x[0-9a-f]+ 20e9 0069 flag.gt 0x1
19 0x[0-9a-f]+ 20e9 00a9 flag.gt 0x2
20 0x[0-9a-f]+ 20e9 0129 flag.gt 0x4
21 0x[0-9a-f]+ 20e9 0229 flag.gt 0x8
22 0x[0-9a-f]+ 20e9 0429 flag.gt 0x10
23 0x[0-9a-f]+ 20e9 0829 flag.gt 0x20
24 0x[0-9a-f]+ 20e9 0f89 0000 0040 flag.gt 0x40
25 0x[0-9a-f]+ 20e9 0f89 0000 0080 flag.gt 0x80
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/arc/
H A Dflag.s18 flag.gt 1
19 flag.gt 2
20 flag.gt 4
21 flag.gt 8
22 flag.gt 16
23 flag.gt 32
24 flag.gt 64
25 flag.gt 128
H A Dflag.d21 30: 09 00 bf 1f 1fbf0009 flag.gt 1
23 38: 09 00 bf 1f 1fbf0009 flag.gt 2
25 40: 09 00 bf 1f 1fbf0009 flag.gt 4
27 48: 09 00 bf 1f 1fbf0009 flag.gt 8
29 50: 09 00 bf 1f 1fbf0009 flag.gt 16
31 58: 09 00 bf 1f 1fbf0009 flag.gt 32
33 60: 09 00 bf 1f 1fbf0009 flag.gt 64
35 68: 09 00 bf 1f 1fbf0009 flag.gt 128
/haiku-buildtools/binutils/gas/testsuite/gas/ppc/
H A Dregnames.s2 cror 4*%cr7+gt,%cr7*4+gt,4*%cr6+gt
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/spu/
H A Dintrinsics-1.c8 vec_uint4 gt, N; local
12 gt = spu_cmpgt(a, N); /* { dg-error "parameter list" } */
13 gt = spu_cmpgt(a, a1); /* { dg-error "integer from pointer without a cast" } */
14 gt = spu_cmpgt(a, b); /* { dg-error "parameter list" } */
15 gt = spu_cmpgt(a, a);
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/i386/
H A D991230-1.c10 static int gt (double a, double b) function
21 if (gt (zero, zero))
/haiku-buildtools/binutils/gas/testsuite/gas/mri/
H A Dif.s5 if d1 <gt> d0 and d2 <gt> d0 then
6 if d1 <gt> d2 then
12 if d0 <gt> d1 or d0 <gt> d2 then
/haiku-buildtools/legacy/binutils/gas/testsuite/gas/mri/
H A Dif.s5 if d1 <gt> d0 and d2 <gt> d0 then
6 if d1 <gt> d2 then
12 if d0 <gt> d1 or d0 <gt> d2 then
/haiku-buildtools/gcc/gcc/testsuite/gcc.c-torture/execute/
H A Dint-compare.c3 gt (a, b) function
39 true (gt (2, 1));
40 false (gt (1, 2));
42 true (gt (INT_MAX, 0));
43 false (gt (0, INT_MAX));
44 true (gt (INT_MAX, 1));
45 false (gt (1, INT_MAX));
47 false (gt (INT_MIN, 0));
48 true (gt (0, INT_MIN));
49 false (gt (INT_MI
[all...]
/haiku-buildtools/binutils/gold/testsuite/
H A Dver_test_8.sh27 if test "$count" -gt 1; then
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/binary_search/
H A D2.cc31 struct gt struct
52 VERIFY(binary_search(C, C + N, 5, gt()));
53 VERIFY(binary_search(C, C + N, first, gt()));
54 VERIFY(binary_search(C, C + N, last, gt()));
55 VERIFY(!binary_search(C, C + N, 4, gt()));
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/heap/
H A D1.cc88 Gt gt; local
101 std::push_heap(s1, s1 + i, gt);
103 VERIFY(gt.count() <= logN);
105 gt.reset();
110 std::pop_heap(s1, s1 + i, gt);
112 VERIFY(gt.count() <= 2 * logN);
114 gt.reset();
124 std::make_heap(s2, s2 + N, gt);
126 VERIFY(gt.count() <= 3 * N);
128 gt
[all...]
H A Dvectorbool.cc90 Gt gt; local
103 std::push_heap(s1.begin(), s1.begin() + i, gt);
105 VERIFY(gt.count() <= logN);
107 gt.reset();
112 std::pop_heap(s1.begin(), s1.begin() + i, gt);
114 VERIFY(gt.count() <= 2 * logN);
116 gt.reset();
126 std::make_heap(s2.begin(), s2.begin() + N, gt);
128 VERIFY(gt.count() <= 3 * N);
130 gt
[all...]
/haiku-buildtools/gcc/gcc/testsuite/gcc.target/sparc/
H A Dsetcc-3.c15 int gt (unsigned long a, unsigned long b) function
H A Dsetcc-1.c29 int gt (unsigned int a, unsigned int b) function
H A Dsetcc-2.c29 int gt (unsigned int a, unsigned int b) function
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/operations/compare/char/
H A D1.cc36 enum want_value {lt=0, z=1, gt=2}; enumerator in enum:want_value
56 case gt:
81 test_value(strcmp(str_0.data(), str_1.data()), gt); local
89 test_value(str_0.compare(str_1), gt); //because r>m
96 test_value(str_2.compare(str_0), gt);
102 test_value(str_1.compare(0, 5, str_2), gt);
108 test_value(str_0.compare(0, 7, str_1, 0, 7), gt);
111 test_value(str_0.compare("costa marbella"), gt);
115 test_value(str_2.compare("cost"), gt);
122 test_value(str_0.compare(0, 7, "costa marbella", 0, 7), gt);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/21_strings/basic_string/operations/compare/wchar_t/
H A D1.cc35 enum want_value {lt=0, z=1, gt=2}; enumerator in enum:want_value
55 case gt:
81 test_value(wcscmp(str_0.data(), str_1.data()), gt); local
89 test_value(str_0.compare(str_1), gt); //because r>m
96 test_value(str_2.compare(str_0), gt);
102 test_value(str_1.compare(0, 5, str_2), gt);
108 test_value(str_0.compare(0, 7, str_1, 0, 7), gt);
111 test_value(str_0.compare(L"costa marbella"), gt);
115 test_value(str_2.compare(L"cost"), gt);
122 test_value(str_0.compare(0, 7, L"costa marbella", 0, 7), gt);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/string_view/operations/compare/char/
H A D1.cc36 enum want_value {lt=0, z=1, gt=2}; enumerator in enum:want_value
56 case gt:
81 test_value(strcmp(str_0.data(), str_1.data()), gt); local
89 test_value(str_0.compare(str_1), gt); //because r>m
96 test_value(str_2.compare(str_0), gt);
102 test_value(str_1.compare(0, 5, str_2), gt);
108 test_value(str_0.compare(0, 7, str_1, 0, 7), gt);
111 test_value(str_0.compare("costa marbella"), gt);
115 test_value(str_2.compare("cost"), gt);
122 test_value(str_0.compare(0, 7, "costa marbella", 0, 7), gt);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/experimental/string_view/operations/compare/wchar_t/
H A D1.cc35 enum want_value {lt=0, z=1, gt=2}; enumerator in enum:want_value
55 case gt:
81 test_value(wcscmp(str_0.data(), str_1.data()), gt); local
89 test_value(str_0.compare(str_1), gt); //because r>m
96 test_value(str_2.compare(str_0), gt);
102 test_value(str_1.compare(0, 5, str_2), gt);
108 test_value(str_0.compare(0, 7, str_1, 0, 7), gt);
111 test_value(str_0.compare(L"costa marbella"), gt);
115 test_value(str_2.compare(L"cost"), gt);
122 test_value(str_0.compare(0, 7, L"costa marbella", 0, 7), gt);
[all...]
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/upper_bound/
H A D2.cc31 struct gt struct
62 const int* t = upper_bound(C, C + N, 3, gt());
65 const int* u = upper_bound(C, C + N, first, gt());
68 const int* v = upper_bound(C, C + N, last, gt());
71 const int* w = upper_bound(C, C + N, 4, gt());
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/lower_bound/
H A D2.cc31 struct gt struct
62 const int* t = lower_bound(C, C + N, 3, gt());
65 const int* u = lower_bound(C, C + N, first, gt());
68 const int* v = lower_bound(C, C + N, last, gt());
71 const int* w = lower_bound(C, C + N, 4, gt());
/haiku-buildtools/gcc/libstdc++-v3/testsuite/25_algorithms/sort/
H A D1.cc74 Gt gt; local
75 gt.reset();
76 std::sort(s1, s1 + N, gt);
/haiku-buildtools/gcc/fixincludes/
H A Dfixinc.in113 if test $VERBOSE -gt 0
158 if test $VERBOSE -gt 0; then
165 if test $VERBOSE -gt 0
199 if test $VERBOSE -gt 1
213 while [ -n "$dirs" ] && [ $levels -gt 0 ]
219 if test $VERBOSE -gt 1
256 if test $VERBOSE -gt 2
277 if test $VERBOSE -gt 1
308 if test $VERBOSE -gt 2
322 if test $VERBOSE -gt
[all...]

Completed in 195 milliseconds

1234567891011>>