| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.overview/ |
| begin_end.pass.cpp | 42 void dyn_test_const ( const dynarray<T> &dyn ) {
43 const T *data = dyn.data ();
44 assert ( data == &*dyn.begin ());
45 assert ( data == &*dyn.cbegin ());
47 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
48 assert ( data + dyn.size() - 1 == &*dyn.crbegin ());
50 assert ( dyn.size () == std::distance ( dyn.begin(), dyn.end()))
[all...] |
| front_back.pass.cpp | 32 void dyn_test_const ( const dynarray<T> &dyn ) {
33 const T *data = dyn.data ();
34 assert ( *data == dyn.front ());
35 assert ( *(data + dyn.size() - 1 ) == dyn.back ());
39 void dyn_test ( dynarray<T> &dyn ) {
40 T *data = dyn.data ();
41 assert ( *data == dyn.front ());
42 assert ( *(data + dyn.size() - 1 ) == dyn.back ())
[all...] |
| at.pass.cpp | 29 void dyn_at_fail ( dynarray<T> &dyn, size_t sz ) {
30 try { dyn.at (sz); }
36 void dyn_at_fail_const ( const dynarray<T> &dyn, size_t sz ) {
37 try { dyn.at (sz); }
44 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
45 const T *data = dyn.data ();
47 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
48 assert ( data + i == &dyn.at(i));
49 assert ( *it == dyn.at(i));
52 dyn_at_fail_const ( dyn, dyn.size ())
[all...] |
| indexing.pass.cpp | 29 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
30 const T *data = dyn.data ();
32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
33 assert ( data + i == &dyn[i]);
34 assert ( *it == dyn[i]);
39 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
40 T *data = dyn.data ();
42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
43 assert ( data + i == &dyn[i]);
44 assert ( *it == dyn[i])
[all...] |
| capacity.pass.cpp | 30 void dyn_test ( const dynarray<T> &dyn, size_t sz ) {
31 assert ( dyn.size () == sz );
32 assert ( dyn.max_size () == sz );
33 assert ( dyn.empty () == ( sz == 0 ));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
| begin_end.pass.cpp | 42 void dyn_test_const ( const dynarray<T> &dyn ) {
43 const T *data = dyn.data ();
44 assert ( data == &*dyn.begin ());
45 assert ( data == &*dyn.cbegin ());
47 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
48 assert ( data + dyn.size() - 1 == &*dyn.crbegin ());
50 assert ( dyn.size () == std::distance ( dyn.begin(), dyn.end()))
[all...] |
| front_back.pass.cpp | 30 void dyn_test_const ( const dynarray<T> &dyn, bool CheckValues = true ) {
31 const T *data = dyn.data ();
32 assert(data == &dyn.front());
33 assert((data + dyn.size() - 1) == &dyn.back());
35 assert ( *data == dyn.front ());
36 assert ( *(data + dyn.size() - 1 ) == dyn.back ());
41 void dyn_test ( dynarray<T> &dyn, bool CheckValues = true ) {
42 T *data = dyn.data ()
[all...] |
| at.pass.cpp | 30 void dyn_at_fail ( dynarray<T> &dyn, size_t sz ) {
31 try { dyn.at (sz); }
37 void dyn_at_fail_const ( const dynarray<T> &dyn, size_t sz ) {
38 try { dyn.at (sz); }
45 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
46 const T *data = dyn.data ();
48 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
49 assert ( data + i == &dyn.at(i));
50 assert ( *it == dyn.at(i));
53 dyn_at_fail_const ( dyn, dyn.size ())
[all...] |
| indexing.pass.cpp | 29 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
30 const T *data = dyn.data ();
32 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
33 assert ( data + i == &dyn[i]);
34 assert ( *it == dyn[i]);
39 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
40 T *data = dyn.data ();
42 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
43 assert ( data + i == &dyn[i]);
44 assert ( *it == dyn[i])
[all...] |
| capacity.pass.cpp | 30 void dyn_test ( const dynarray<T> &dyn, size_t sz ) {
31 assert ( dyn.size () == sz );
32 assert ( dyn.max_size () == sz );
33 assert ( dyn.empty () == ( sz == 0 ));
|
| /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.overview/ |
| begin_end.pass.cpp | 42 void dyn_test_const ( const dynarray<T> &dyn ) {
43 const T *data = dyn.data ();
44 assert ( data == &*dyn.begin ());
45 assert ( data == &*dyn.cbegin ());
47 assert ( data + dyn.size() - 1 == &*dyn.rbegin ());
48 assert ( data + dyn.size() - 1 == &*dyn.crbegin ());
50 std::ptrdiff_t ds = static_cast<std::ptrdiff_t>(dyn.size());
51 assert (ds == std::distance ( dyn.begin(), dyn.end()))
[all...] |
| at.pass.cpp | 29 void dyn_at_fail ( dynarray<T> &dyn, size_t sz ) {
30 try { dyn.at (sz); }
36 void dyn_at_fail_const ( const dynarray<T> &dyn, size_t sz ) {
37 try { dyn.at (sz); }
44 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
45 const T *data = dyn.data ();
47 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
48 assert ( data + i == &dyn.at(i));
49 assert ( *it == dyn.at(i));
52 dyn_at_fail_const ( dyn, dyn.size ())
[all...] |
| front_back.pass.cpp | 30 void dyn_test_const ( const dynarray<T> &dyn, bool CheckValues = true ) {
31 const T *data = dyn.data ();
32 assert(data == &dyn.front());
33 assert((data + dyn.size() - 1) == &dyn.back());
35 assert ( *data == dyn.front ());
36 assert ( *(data + dyn.size() - 1 ) == dyn.back ());
41 void dyn_test ( dynarray<T> &dyn, bool CheckValues = true ) {
42 T *data = dyn.data ()
[all...] |
| indexing.pass.cpp | 28 void dyn_test_const ( const dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
29 const T *data = dyn.data ();
31 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
32 assert ( data + i == &dyn[i]);
33 assert ( *it == dyn[i]);
38 void dyn_test ( dynarray<T> &dyn, const std::initializer_list<T> &vals ) {
39 T *data = dyn.data ();
41 for ( size_t i = 0; i < dyn.size(); ++i, ++it ) {
42 assert ( data + i == &dyn[i]);
43 assert ( *it == dyn[i])
[all...] |
| capacity.pass.cpp | 29 void dyn_test ( const dynarray<T> &dyn, size_t sz ) {
30 assert ( dyn.size () == sz );
31 assert ( dyn.max_size () == sz );
32 assert ( dyn.empty () == ( sz == 0 ));
|
| /external/syslinux/gnu-efi/gnu-efi-3.0/gnuefi/ |
| reloc_ia32.c | 41 EFI_STATUS _relocate (long ldbase, Elf32_Dyn *dyn, EFI_HANDLE image, EFI_SYSTEM_TABLE *systab)
48 for (i = 0; dyn[i].d_tag != DT_NULL; ++i) {
49 switch (dyn[i].d_tag) {
52 ((unsigned long)dyn[i].d_un.d_ptr
57 relsz = dyn[i].d_un.d_val;
61 relent = dyn[i].d_un.d_val;
|
| reloc_x86_64.c | 43 EFI_STATUS _relocate (long ldbase, Elf64_Dyn *dyn, EFI_HANDLE image, EFI_SYSTEM_TABLE *systab)
50 for (i = 0; dyn[i].d_tag != DT_NULL; ++i) {
51 switch (dyn[i].d_tag) {
54 ((unsigned long)dyn[i].d_un.d_ptr
59 relsz = dyn[i].d_un.d_val;
63 relent = dyn[i].d_un.d_val;
|
| /external/libcxx/test/libcxx/experimental/containers/sequences/dynarray/dynarray.data/ |
| default.pass.cpp | 28 void dyn_test_const(const dynarray<T> &dyn, bool CheckEquals = true) {
29 const T *data = dyn.data ();
32 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
37 void dyn_test( dynarray<T> &dyn, bool CheckEquals = true) {
38 T *data = dyn.data ();
41 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.data/ |
| default.pass.cpp | 30 void dyn_test_const ( const dynarray<T> &dyn ) {
31 const T *data = dyn.data ();
33 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
37 void dyn_test ( dynarray<T> &dyn ) {
38 T *data = dyn.data ();
40 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/libcxx/experimental/containers/sequences/dynarray/dynarray.data/ |
| default.pass.cpp | 28 void dyn_test_const(const dynarray<T> &dyn, bool CheckEquals = true) {
29 const T *data = dyn.data ();
32 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
37 void dyn_test( dynarray<T> &dyn, bool CheckEquals = true) {
38 T *data = dyn.data ();
41 assert ( std::equal ( dyn.begin(), dyn.end(), data ));
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-arm/ |
| unresolved-1-dyn.d | 6 Relocation section '\.rel\.dyn' .*
|
| /toolchain/binutils/binutils-2.25/ld/testsuite/ld-elf/ |
| dynsym1.d | 3 #readelf: --dyn-syms
|
| provide-hidden.exp | 58 [list readelf -s provide-hidden-dyn.nd]] \
67 [list readelf -s provide-hidden-dyn.nd]] \
76 [list readelf -s provide-hidden-dyn.nd]] \
92 [list readelf -s provide-hidden-dyn.nd]] \
101 [list readelf -s provide-hidden-dyn.nd]] \
110 [list readelf -s provide-hidden-dyn.nd]] \
119 [list readelf -s provide-hidden-dyn.nd]] \
128 [list readelf -s provide-hidden-dyn.nd]] \
144 [list readelf -s provide-hidden-dyn.nd]] \
153 [list readelf -s provide-hidden-dyn.nd]]
[all...] |
| /external/elfutils/backends/ |
| alpha_symbol.c | 113 GElf_Dyn dyn; local
114 if (unlikely (gelf_getdyn (data, i, &dyn) == NULL))
116 if (dyn.d_tag == DT_PLTGOT)
117 pltgot = dyn.d_un.d_ptr;
118 else if (dyn.d_tag == DT_ALPHA_PLTRO && dyn.d_un.d_val != 0)
|
| /external/elfutils/libelf/ |
| gelf_update_dyn.c | 62 Elf32_Dyn *dyn; local
81 dyn = &((Elf32_Dyn *) data_scn->d.d_buf)[ndx];
83 dyn->d_tag = src->d_tag;
84 dyn->d_un.d_val = src->d_un.d_val;
|
