| /ndk/sources/host-tools/sed-4.2.1/lib/ |
| D | unlocked-io.h | 38 # define clearerr(x) clearerr_unlocked (x) argument
40 # define clearerr_unlocked(x) clearerr (x) argument
45 # define feof(x) feof_unlocked (x) argument
47 # define feof_unlocked(x) feof (x) argument
52 # define ferror(x) ferror_unlocked (x) argument
54 # define ferror_unlocked(x) ferror (x) argument
59 # define fflush(x) fflush_unlocked (x) argument
61 # define fflush_unlocked(x) fflush (x) argument
66 # define fgets(x,y,z) fgets_unlocked (x,y,z) argument
68 # define fgets_unlocked(x,y,z) fgets (x,y,z) argument
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/re/re.submatch/re.submatch.op/ |
| D | compare.pass.cpp | 221 test(const std::basic_string<CharT>& x, const std::basic_string<CharT>& y) in test() argument
226 sm1.first = x.begin(); in test()
227 sm1.second = x.end(); in test()
233 assert((sm1 == sm2) == (x == y)); in test()
234 assert((sm1 != sm2) == (x != y)); in test()
235 assert((sm1 < sm2) == (x < y)); in test()
236 assert((sm1 > sm2) == (x > y)); in test()
237 assert((sm1 <= sm2) == (x <= y)); in test()
238 assert((sm1 >= sm2) == (x >= y)); in test()
239 assert((x == sm2) == (x == y)); in test()
[all …]
|
| /ndk/sources/host-tools/make-3.81/tests/scripts/options/ |
| D | dash-W | 8 a.x: b.x
9 a.x b.x: ; echo >> $@
11 '', "echo >> b.x\necho >> a.x");
15 run_make_test(undef, '', "#MAKE#: `a.x' is up to date.");
17 # Now run it with -W b.x: should rebuild a.x
19 run_make_test(undef, '-W b.x', 'echo >> a.x');
21 # Put the timestamp for a.x into the future; it should still be remade.
23 utouch(1000, 'a.x');
24 run_make_test(undef, '', "#MAKE#: `a.x' is up to date.");
25 run_make_test(undef, '-W b.x', 'echo >> a.x');
[all …]
|
| /ndk/sources/cxx-stl/stlport/src/ |
| D | num_put_float.cpp | 31 #define todigit(x) ((x)+'0') argument
130 static inline bool _Stl_is_nan_or_inf(double x) in _Stl_is_nan_or_inf() argument
132 { return !isfinite(x); } in _Stl_is_nan_or_inf()
134 { return !finite(x); }
136 static inline bool _Stl_is_neg_nan(double x) { return isnan(x) && ( copysign(1., x) < 0 ); } in _Stl_is_neg_nan() argument
137 static inline bool _Stl_is_inf(double x) { return isinf(x); } in _Stl_is_inf() argument
139 static inline bool _Stl_is_neg_inf(double x) { return isinf(x) && x < 0; } in _Stl_is_neg_inf() argument
143 static inline bool _Stl_is_nan_or_inf(double x) { return IsNANorINF(x); } in _Stl_is_nan_or_inf() argument
144 static inline bool _Stl_is_inf(double x) { return IsNANorINF(x) && IsINF(x); } in _Stl_is_inf() argument
145 static inline bool _Stl_is_neg_inf(double x) { return (IsINF(x)) && (x < 0.0); } in _Stl_is_neg_inf() argument
[all …]
|
| /ndk/sources/host-tools/nawk-20071023/ |
| D | parse.c | 34 Node *x; in nodealloc() local
36 x = (Node *) malloc(sizeof(Node) + (n-1)*sizeof(Node *)); in nodealloc()
37 if (x == NULL) in nodealloc()
39 x->nnext = NULL; in nodealloc()
40 x->lineno = lineno; in nodealloc()
41 return(x); in nodealloc()
52 Node *x; in node1() local
54 x = nodealloc(1); in node1()
55 x->nobj = a; in node1()
56 x->narg[0]=b; in node1()
[all …]
|
| D | run.c | 37 #define tempfree(x) if (istemp(x)) tfree(x); else argument
140 Cell *x; in execute() local
148 x = (Cell *) (a->narg[0]); in execute()
149 if (isfld(x) && !donefld) in execute()
151 else if (isrec(x) && !donerec) in execute()
153 return(x); in execute()
158 x = (*proc)(a->narg, a->nobj); in execute()
159 if (isfld(x) && !donefld) in execute()
161 else if (isrec(x) && !donerec) in execute()
164 return(x); in execute()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/localization/locale.categories/category.collate/locale.collate.byname/ |
| D | transform.pass.cpp | 31 std::string x("1234"); in main() local
33 assert(f.transform(x.data(), x.data() + x.size()) != x); in main()
36 std::wstring x(L"1234"); in main() local
38 assert(f.transform(x.data(), x.data() + x.size()) != x); in main()
44 std::string x("1234"); in main() local
46 assert(f.transform(x.data(), x.data() + x.size()) != x); in main()
49 std::wstring x(L"1234"); in main() local
51 assert(f.transform(x.data(), x.data() + x.size()) != x); in main()
57 std::string x("1234"); in main() local
59 assert(f.transform(x.data(), x.data() + x.size()) == x); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/include/support/win32/ |
| D | support.h | 56 _LIBCPP_ALWAYS_INLINE int __builtin_popcount(unsigned int x) { in __builtin_popcount() argument
61 x -= (x >> 1) & m1; //put count of each 2 bits into those 2 bits in __builtin_popcount()
62 x = (x & m2) + ((x >> 2) & m2); //put count of each 4 bits into those 4 bits in __builtin_popcount()
63 x = (x + (x >> 4)) & m4; //put count of each 8 bits into those 8 bits in __builtin_popcount()
64 return (x * h01) >> 24; //returns left 8 bits of x + (x<<8) + (x<<16) + (x<<24) in __builtin_popcount()
67 _LIBCPP_ALWAYS_INLINE int __builtin_popcountl(unsigned long x) { in __builtin_popcountl() argument
68 return __builtin_popcount(static_cast<int>(x)); in __builtin_popcountl()
71 _LIBCPP_ALWAYS_INLINE int __builtin_popcountll(unsigned long long x) { in __builtin_popcountll() argument
76 x -= (x >> 1) & m1; //put count of each 2 bits into those 2 bits in __builtin_popcountll()
77 x = (x & m2) + ((x >> 2) & m2); //put count of each 4 bits into those 4 bits in __builtin_popcountll()
[all …]
|
| D | math_win32.h | 41 _LIBCPP_ALWAYS_INLINE bool isgreater( double x, double y ) in isgreater() argument
43 if(_fpclass(x) == _FPCLASS_SNAN || _fpclass(y) == _FPCLASS_SNAN) return false; in isgreater()
44 else return x > y; in isgreater()
47 _LIBCPP_ALWAYS_INLINE bool isgreaterequal( double x, double y ) in isgreaterequal() argument
49 if(_fpclass(x) == _FPCLASS_SNAN || _fpclass(y) == _FPCLASS_SNAN) return false; in isgreaterequal()
50 else return x >= y; in isgreaterequal()
53 _LIBCPP_ALWAYS_INLINE bool isless( double x, double y ) in isless() argument
55 if(_fpclass(x) == _FPCLASS_SNAN || _fpclass(y) == _FPCLASS_SNAN) return false; in isless()
56 else return x < y; in isless()
59 _LIBCPP_ALWAYS_INLINE bool islessequal( double x, double y ) in islessequal() argument
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.min.max/ |
| D | minmax.pass.cpp | 21 test(const T& a, const T& b, const T& x, const T& y) in test() argument
24 assert(&p.first == &x); in test()
31 int x = 0; in main() local
33 test(x, y, x, y); in main()
34 test(y, x, y, x); in main()
37 int x = 0; in main() local
39 test(x, y, x, y); in main()
40 test(y, x, x, y); in main()
43 int x = 1; in main() local
45 test(x, y, y, x); in main()
[all …]
|
| D | min.pass.cpp | 21 test(const T& a, const T& b, const T& x) in test() argument
23 assert(&std::min(a, b) == &x); in test()
29 int x = 0; in main() local
31 test(x, y, x); in main()
32 test(y, x, y); in main()
35 int x = 0; in main() local
37 test(x, y, x); in main()
38 test(y, x, x); in main()
41 int x = 1; in main() local
43 test(x, y, y); in main()
[all …]
|
| D | max.pass.cpp | 21 test(const T& a, const T& b, const T& x) in test() argument
23 assert(&std::max(a, b) == &x); in test()
29 int x = 0; in main() local
31 test(x, y, x); in main()
32 test(y, x, y); in main()
35 int x = 0; in main() local
37 test(x, y, y); in main()
38 test(y, x, y); in main()
41 int x = 1; in main() local
43 test(x, y, x); in main()
[all …]
|
| D | minmax_comp.pass.cpp | 23 test(const T& a, const T& b, C c, const T& x, const T& y) in test() argument
26 assert(&p.first == &x); in test()
33 int x = 0; in main() local
35 test(x, y, std::greater<int>(), x, y); in main()
36 test(y, x, std::greater<int>(), y, x); in main()
39 int x = 0; in main() local
41 test(x, y, std::greater<int>(), y, x); in main()
42 test(y, x, std::greater<int>(), y, x); in main()
45 int x = 1; in main() local
47 test(x, y, std::greater<int>(), x, y); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/atomics/atomics.types.generic/ |
| D | bool.pass.cpp | 76 bool x = obj; in main() local
77 assert(obj.compare_exchange_weak(x, false) == true); in main()
79 assert(x == true); in main()
80 assert(obj.compare_exchange_weak(x, true, in main()
83 assert(x == false); in main()
85 x = true; in main()
86 assert(obj.compare_exchange_weak(x, false, in main()
90 assert(x == true); in main()
91 x = true; in main()
93 assert(obj.compare_exchange_strong(x, false) == true); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/input.output/file.streams/fstreams/ofstream.assign/ |
| D | nonmember_swap.pass.cpp | 37 double x = 0; in main() local
38 fs >> x; in main()
39 assert(x == 3.25); in main()
40 fs >> x; in main()
41 assert(x == 4.5); in main()
46 double x = 0; in main() local
47 fs >> x; in main()
48 assert(x == 4.5); in main()
49 fs >> x; in main()
50 assert(x == 3.25); in main()
[all …]
|
| D | member_swap.pass.cpp | 36 double x = 0; in main() local
37 fs >> x; in main()
38 assert(x == 3.25); in main()
39 fs >> x; in main()
40 assert(x == 4.5); in main()
45 double x = 0; in main() local
46 fs >> x; in main()
47 assert(x == 4.5); in main()
48 fs >> x; in main()
49 assert(x == 3.25); in main()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/complex.number/complex.transcendentals/ |
| D | exp.pass.cpp | 23 test(const std::complex<T>& c, std::complex<T> x) in test() argument
25 assert(exp(c) == x); in test()
37 const unsigned N = sizeof(x) / sizeof(x[0]); in test_edges()
40 std::complex<double> r = exp(x[i]); in test_edges()
41 if (x[i].real() == 0 && x[i].imag() == 0) in test_edges()
45 assert(std::signbit(x[i].imag()) == std::signbit(r.imag())); in test_edges()
47 else if (std::isfinite(x[i].real()) && std::isinf(x[i].imag())) in test_edges()
52 else if (std::isfinite(x[i].real()) && std::isnan(x[i].imag())) in test_edges()
57 else if (std::isinf(x[i].real()) && x[i].real() > 0 && x[i].imag() == 0) in test_edges()
62 assert(std::signbit(x[i].imag()) == std::signbit(r.imag())); in test_edges()
[all …]
|
| D | log.pass.cpp | 23 test(const std::complex<T>& c, std::complex<T> x) in test() argument
25 assert(log(c) == x); in test()
38 const unsigned N = sizeof(x) / sizeof(x[0]); in test_edges()
41 std::complex<double> r = log(x[i]); in test_edges()
42 if (x[i].real() == 0 && x[i].imag() == 0) in test_edges()
44 if (std::signbit(x[i].real())) in test_edges()
48 if (std::signbit(x[i].imag())) in test_edges()
58 assert(std::signbit(x[i].imag()) == std::signbit(r.imag())); in test_edges()
61 else if (std::isfinite(x[i].real()) && std::isinf(x[i].imag())) in test_edges()
65 if (x[i].imag() > 0) in test_edges()
[all …]
|
| D | acos.pass.cpp | 23 test(const std::complex<T>& c, std::complex<T> x) in test() argument
25 assert(acos(c) == x); in test()
39 const unsigned N = sizeof(x) / sizeof(x[0]); in test_edges()
42 std::complex<double> r = acos(x[i]); in test_edges()
43 if (x[i].real() == 0 && x[i].imag() == 0) in test_edges()
47 assert(std::signbit(x[i].imag()) != std::signbit(r.imag())); in test_edges()
49 else if (x[i].real() == 0 && std::isnan(x[i].imag())) in test_edges()
54 else if (std::isfinite(x[i].real()) && std::isinf(x[i].imag())) in test_edges()
58 assert(std::signbit(x[i].imag()) != std::signbit(r.imag())); in test_edges()
60 else if (std::isfinite(x[i].real()) && x[i].real() != 0 && std::isnan(x[i].imag())) in test_edges()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/ |
| D | Emplaceable.h | 16 Emplaceable(Emplaceable&& x) in Emplaceable() argument
17 : int_(x.int_), double_(x.double_) in Emplaceable()
18 {x.int_ = 0; x.double_ = 0;} in Emplaceable()
19 Emplaceable& operator=(Emplaceable&& x)
20 {int_ = x.int_; x.int_ = 0;
21 double_ = x.double_; x.double_ = 0;
24 bool operator==(const Emplaceable& x) const
25 {return int_ == x.int_ && double_ == x.double_;}
26 bool operator<(const Emplaceable& x) const
27 {return int_ < x.int_ || (int_ == x.int_ && double_ < x.double_);}
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/iterators/predef.iterators/insert.iterators/insert.iter.ops/insert.iter.op=/ |
| D | rv_value.pass.cpp | 62 int x[6] = {0}; in main() local
64 c1.push_back(Ptr(x+i)); in main()
67 c2.push_back(Ptr(x+i)); in main()
68 insert3at(c2, c2.begin(), Ptr(x+3), Ptr(x+4), Ptr(x+5)); in main()
69 test(std::move(c1), 0, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2); in main()
72 c1.push_back(Ptr(x+i)); in main()
75 c2.push_back(Ptr(x+i)); in main()
76 insert3at(c2, c2.begin()+1, Ptr(x+3), Ptr(x+4), Ptr(x+5)); in main()
77 test(std::move(c1), 1, Ptr(x+3), Ptr(x+4), Ptr(x+5), c2); in main()
80 c1.push_back(Ptr(x+i)); in main()
[all …]
|
| /ndk/sources/host-tools/sed-4.2.1/testsuite/ |
| D | runtests.c | 62 int x; in run_a_test() local
94 for (x = 0; x < 10; ++x) in run_a_test()
95 regs[x].rm_so = regs[x].rm_eo = -1; in run_a_test()
104 for (x = 0; x < 10; ++x) in run_a_test()
105 if (regs[x].rm_so != -1) in run_a_test()
107 x, in run_a_test()
108 regs[x].rm_so, in run_a_test()
109 regs[x].rm_eo, in run_a_test()
110 regs[x].rm_eo - regs[x].rm_so, in run_a_test()
111 t->data + regs[x].rm_so); in run_a_test()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/associative/ |
| D | tree_right_rotate.pass.cpp | 33 Node x; in test1() local
35 root.__left_ = &x; in test1()
36 x.__left_ = &y; in test1()
37 x.__right_ = 0; in test1()
38 x.__parent_ = &root; in test1()
41 y.__parent_ = &x; in test1()
42 std::__tree_right_rotate(&x); in test1()
48 assert(y.__right_ == &x); in test1()
49 assert(x.__parent_ == &y); in test1()
50 assert(x.__left_ == 0); in test1()
[all …]
|
| D | tree_left_rotate.pass.cpp | 33 Node x; in test1() local
35 root.__left_ = &x; in test1()
36 x.__left_ = 0; in test1()
37 x.__right_ = &y; in test1()
38 x.__parent_ = &root; in test1()
41 y.__parent_ = &x; in test1()
42 std::__tree_left_rotate(&x); in test1()
47 assert(y.__left_ == &x); in test1()
49 assert(x.__parent_ == &y); in test1()
50 assert(x.__left_ == 0); in test1()
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/test/numerics/complex.number/complex.value.ops/ |
| D | arg.pass.cpp | 32 const unsigned N = sizeof(x) / sizeof(x[0]); in test_edges()
35 double r = arg(x[i]); in test_edges()
36 if (std::isnan(x[i].real()) || std::isnan(x[i].imag())) in test_edges()
40 switch (classify(x[i])) in test_edges()
43 if (std::signbit(x[i].real())) in test_edges()
45 if (std::signbit(x[i].imag())) in test_edges()
52 assert(std::signbit(x[i].imag()) == std::signbit(r)); in test_edges()
56 if (x[i].real() == 0) in test_edges()
58 if (x[i].imag() < 0) in test_edges()
63 else if (x[i].imag() == 0) in test_edges()
[all …]
|