| /external/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 ));
|
| /ndk/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 ));
|
| /external/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 ));
|
| /ndk/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 ));
|
| /external/elfutils/0.153/backends/ |
| alpha_symbol.c | 110 GElf_Dyn dyn; local
111 if (unlikely (gelf_getdyn (data, i, &dyn) == NULL))
113 if (dyn.d_tag == DT_PLTGOT)
114 pltgot = dyn.d_un.d_ptr;
115 else if (dyn.d_tag == DT_ALPHA_PLTRO && dyn.d_un.d_val != 0)
|
| sparc_symbol.c | 96 GElf_Dyn dyn; local
97 if (unlikely (gelf_getdyn (data, i, &dyn) == NULL))
99 if (dyn.d_tag == DT_PLTGOT)
100 return dyn.d_un.d_ptr == shdr->sh_addr;
|
| ppc_symbol.c | 98 GElf_Dyn *dyn = gelf_getdyn (data, j, &dyn_mem); local
99 if (dyn != NULL && dyn->d_tag == DT_PPC_GOT)
101 *addr = dyn->d_un.d_ptr;
|
| /external/elfutils/0.153/libelf/ |
| gelf_update_dyn.c | 92 Elf32_Dyn *dyn; local
111 dyn = &((Elf32_Dyn *) data_scn->d.d_buf)[ndx];
113 dyn->d_tag = src->d_tag;
114 dyn->d_un.d_val = src->d_un.d_val;
|
| /external/chromium_org/third_party/mesa/src/src/mapi/mapi/ |
| mapi.c | 49 struct mapi_stub *dyn = stub_find_dynamic(name, 1); local
50 if (dyn) {
51 stub_fix_dynamic(dyn, alias);
52 stub = dyn;
|
| /external/mesa3d/src/mapi/mapi/ |
| mapi.c | 49 struct mapi_stub *dyn = stub_find_dynamic(name, 1); local
50 if (dyn) {
51 stub_fix_dynamic(dyn, alias);
52 stub = dyn;
|
| /external/libcxx/test/containers/sequences/dynarray/dynarray.cons/ |
| alloc.pass.cpp | 39 void check_allocator ( const dynarray<T> &dyn, const Allocator &alloc ) {
40 for ( int i = 0; i < dyn.size (); ++i )
41 assert ( dyn[i].get_allocator() == alloc );
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/dynarray/dynarray.cons/ |
| alloc.pass.cpp | 39 void check_allocator ( const dynarray<T> &dyn, const Allocator &alloc ) {
40 for ( int i = 0; i < dyn.size (); ++i )
41 assert ( dyn[i].get_allocator() == alloc );
|
| /external/clang/test/CXX/except/except.spec/ |
| p2-places.cpp | 5 namespace dyn { namespace
|
| /external/chromium_org/tools/relocation_packer/test_data/ |
| generate_elf_file_unittest_relocs.py | 25 # Copy and add a 'NULL' .android.rel.dyn section for the packing tool.
44 # Unpack relocations. We leave the .android.rel.dyn or .android.rela.dyn
58 choices=['.android.rel.dyn', '.android.rela.dyn'],
59 help='Section to add, one of ".android.rel.dyn" or ".android.rela.dyn"')
|
| /external/ltrace/sysdeps/linux-gnu/mips/ |
| plt.c | 223 GElf_Dyn dyn; local
224 if (gelf_getdyn(data, j, &dyn) == NULL)
227 if(dyn.d_tag == DT_PLTGOT) {
228 lte->arch.pltgot_addr = dyn.d_un.d_ptr;
230 if(dyn.d_tag == DT_MIPS_LOCAL_GOTNO){
231 lte->arch.mips_local_gotno = dyn.d_un.d_val;
233 if(dyn.d_tag == DT_MIPS_GOTSYM){
234 lte->arch.mips_gotsym = dyn.d_un.d_val;
|
| /external/chromium_org/third_party/android_crazy_linker/src/src/ |
| crazy_linker_elf_symbols.cpp | 31 ElfView::DynamicIterator dyn(view);
32 for (; dyn.HasNext(); dyn.GetNext()) {
33 uintptr_t dyn_addr = dyn.GetAddress(view->load_bias());
34 switch (dyn.GetTag()) {
|
| /external/libunwind/src/ia64/ |
| Gfind_unwind_table.c | 50 Elf64_Dyn *dyn = (Elf64_Dyn *) (pdyn->p_offset + (char *) edi->ei.image); local
51 for (; dyn->d_tag != DT_NULL; ++dyn)
52 if (dyn->d_tag == DT_PLTGOT)
54 gp = (Elf64_Addr) dyn->d_un.d_ptr + load_base;
|
